|
|
|
|
|
Jing Liu and Yong Zhong
As a structural indicator of dense subgraphs, k-core has been widely used in community search due to its concise and efficient calculation. Many community search algorithms have been expanded on the basis of k-core. However, relevant algorithms often set...
ver más
|
|
|
|
|
|
|
|
|
|
|
András Faragó and Zohre R. Mojaveri
In this survey paper, we review various concepts of graph density, as well as associated theorems and algorithms. Our goal is motivated by the fact that, in many applications, it is a key algorithmic task to extract a densest subgraph from an input graph...
ver más
|
|
|
|
|
|
|
|
|
|
|
Charles A. Phillips, Kai Wang, Erich J. Baker, Jason A. Bubier, Elissa J. Chesler and Michael A. Langston
Let k denote an integer greater than 2, let G denote a k-partite graph, and let S denote the set of all maximal k-partite cliques in G. Several open questions concerning the computation of S are resolved. A straightforward and highly-scalable modificatio...
ver más
|
|
|
|
|
|