MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for "On Finding Dense Subgraphs." – sorted by Relevance.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 12 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Unbalanced graph cuts  
  • by Ara Hayrapetyan, David Kempe, Martin Pál, Zoya Svitkina — 2005 — In Proc. 13th European Symp. on Algorithms
  • … control, military containment, as well as finding dense subgraphs and communities in graphs. In general…
  • Cited by 7 (4 self)Add To MetaCart
  • Discovering Large Dense Subgraphs in Massive Graphs  
  • by David Gibson Ravi, Ravi Kumar, Andrew Tomkins — 2005 — In VLDB ’05: Proceedings of the 31st international conference on Very large data bases
  • …@almaden}.ibm.com Abstract We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm…
  • Add To MetaCart
  • Graph Sketches  
  • by Technical Note James, James Abello, Irene Finocchi, Jeffrey Korn
  • … " 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 Prof Rossella Petreschi (advisor, Di Battista, Prof Stefano Levialdi, Prof Narsingh Deo, Prof Bernard Moret, Irene Finocchi, Irene Finocchi, Irene Finocchi — 2002
  • … by addressing two common problems: finding large cuts and locating dense subgraphs. Since ideally one would…
  • Add To MetaCart
  • unknown title  
  • by The Complexity, Detecting Fixed-density, Clusters Klaus, Holzapfel Sven, Kosub Moritz, G. Maass
  • … (see, e.g., [7, 15, 1]). The fundamental task in density-based clustering is finding a dense subgraph
  • Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB