Searching for "On Finding Dense Subgraphs." – sorted by Relevance.
-
Unbalanced graph cuts
- control, military containment, as well as finding dense subgraphs and communities in graphs. In general
- Cited by 7 (4 self) – Add To MetaCart
-
Extraction and Classification of Dense Communities in the Web ∗
- contribution is a new scalable algorithm for finding relatively dense subgraphs in massive graphs. We apply our
- Cited by 1 (0 self) – Add To MetaCart
-
Discovering Large Dense Subgraphs in Massive Graphs
- @almaden}.ibm.com Abstract We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm
- Add To MetaCart
-
Finding Solvable Subsets of Constraint Graphs Christoph M. Hoffmann1 Andrew Lomonosov2
- will be minimal. For certain overconstrained problems, finding minimal dense subgraphs may require up to O(n2(m
- Add To MetaCart
-
Graph Sketches
- " subgraphs. The sketch should be tailored to the task at hand. For example, if the goal is to find dense
- Add To MetaCart
-
Hierarchical Decompositions for Visualizing Large Graphs
- by addressing two common problems: finding large cuts and locating dense subgraphs. Since ideally one would
- Add To MetaCart
-
unknown title
- (see, e.g., [7, 15, 1]). The fundamental task in density-based clustering is finding a dense subgraph
- Add To MetaCart
-
The Complexity of Detecting Fixed-Density Clusters \Lambda
- (see, e.g., [7, 15, 1]). The fundamental task in density-based clustering is finding a dense subgraph
- Add To MetaCart
-
The complexity of detecting fixed-density clusters, Discrete Applied Mathematics
- , 15, 1]). The fundamental task in density-based clustering is finding a dense subgraph (cluster) of a
- Cited by 1 (0 self) – Add To MetaCart
-
MGV: A System for Visualizing Massive Multi-Digraphs
- be tailored to the task at hand. For example, if the goal is to find dense subgraphs, the sketch needs
- Cited by 26 (7 self) – Add To MetaCart

