301 search results - page 3 / 61 » On Finding Dense Subgraphs |
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
JCT
2008
14 years 9 months ago
2008
A conjecture by Bollob
SIAMDM
2008
14 years 9 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
GBRPR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present a direct algorithm that computes a largest common connected induced subgraph of two given graphs. It is based on an efficient generation of the common connecte...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Dense sub-graphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Most existing community detection algori...