Sciweavers

37 search results - page 1 / 8
» Discovering Large Dense Subgraphs in Massive Graphs
Sort
View
VLDB
2005
ACM
177views Database» more  VLDB 2005»
13 years 9 months ago
Discovering Large Dense Subgraphs in Massive Graphs
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
David Gibson, Ravi Kumar, Andrew Tomkins
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
14 years 5 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou
WWW
2007
ACM
14 years 5 months ago
Extraction and classification of dense communities in the web
The World Wide Web (WWW) is rapidly becoming important for society as a medium for sharing data, information and services, and there is a growing interest in tools for understandi...
Yon Dourisboure, Filippo Geraci, Marco Pellegrini
JCT
2008
109views more  JCT 2008»
13 years 4 months ago
Spanning 3-colourable subgraphs of small bandwidth in dense graphs
A conjecture by Bollob
Julia Böttcher, Mathias Schacht, Anusch Taraz
COMSWARE
2008
IEEE
13 years 6 months ago
Extracting dense communities from telecom call graphs
Social networks refer to structures made of nodes that represent people or other entities embedded in a social context, and whose edges represent interaction between entities. Typi...
Vinayaka Pandit, Natwar Modani, Sougata Mukherjea,...