Isolation Concepts for Enumerating Dense Subgraphs

DOI10.1007/978-3-540-73545-8_16zbMATH Open1206.68237OpenAlexW1551538598MaRDI QIDQ3608840FDOQ3608840

Christian Komusiewicz, Hannes Moser, Rolf Niedermeier, Falk Hüffner

Publication date: 6 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73545-8_16

Recommendations

• Isolation concepts for efficiently enumerating dense subgraphs
• Enumeration of isolated cliques and pseudo-cliques
• Isolation concepts for clique enumeration: comparison and computational experiments
• Algorithms – ESA 2005
• Enumerating Isolated Cliques in Synthetic and Financial Networks

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30)

Cited In (4)

• Enumerating Isolated Cliques in Synthetic and Financial Networks
• Isolation concepts for clique enumeration: comparison and computational experiments
• Isolation concepts for efficiently enumerating dense subgraphs
• A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing

This page was built for publication: Isolation Concepts for Enumerating Dense Subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608840)