Isolation concepts for efficiently enumerating dense subgraphs
DOI10.1016/j.tcs.2009.04.021zbMath1171.68030MaRDI QIDQ837155
Rolf Niedermeier, Christian Komusiewicz, Hannes Moser, Falk Hüffner
Publication date: 10 September 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.04.021
clique; exact algorithm; NP-hard problem; fixed-parameter tractability; parameterized complexity; \(s\)-plex
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C30: Enumeration in graph theory
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
