Isolation Concepts for Enumerating Dense Subgraphs

DOI10.1007/978-3-540-73545-8_16zbMath1206.68237OpenAlexW1551538598MaRDI QIDQ3608840

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

Mathematics Subject Classification ID

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

Related Items (4)

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

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