Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?

DOI10.1007/978-3-642-40313-2_60zbMath1400.68160MaRDI QIDQ2849953

Saket Saurabh, Fahad Panolan, Neeldhara Misra

Publication date: 20 September 2013

Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40313-2_60

zbMATH Keywords

subexponential algorithms; \(s\)-clubs; cluster edge deletion; ETH-hardness

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)