期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
DETERMINATION OF THE DENSEST SUBGRAPH
1
作者 dongjinquan LIUYanpei 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2004年第1期23-27,共5页
Define the density d(G) of a graph G as (ε(G))/(v(G)). A polynomialalgorithm for finding the densest subgraph of a graph is provided. Some results related to thedensity of the densest subgraph of a graph are obtained... Define the density d(G) of a graph G as (ε(G))/(v(G)). A polynomialalgorithm for finding the densest subgraph of a graph is provided. Some results related to thedensity of the densest subgraph of a graph are obtained as well. 展开更多
关键词 DENSITY ALGORITHM ORIENTATION computable
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部