301 search results - page 7 / 61 » On Finding Dense Subgraphs |
DM
2002
14 years 9 months ago
2002
A basic problem in the design of mobile telephone networks is to assign sets of radio frequency bands (colours) to transmitters (vertices) to avoid interference. Often the transmi...
CORR
2010
Springer
14 years 4 months ago
2010
Springer
CORR
2012
Springer
13 years 5 months ago
2012
Springer
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and ...
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
A spanner of a graph is a sparse subgraph that approximately preserves distances in the original graph. More precisely, a subgraph H = (V, EH ) is a k-spanner of a graph G = (V, E...
CORR
2012
Springer
13 years 5 months ago
2012
Springer
In this work, we study the correlation between attribute sets and the occurrence of dense subgraphs in large attributed graphs, a task we call structural correlation pattern minin...