A Fast Branching Algorithm for Cluster Vertex Deletion
From MaRDI portal
Publication:4981153
DOI10.1007/978-3-319-06686-8_9zbMath1330.68220arXiv1306.3877MaRDI QIDQ4981153
Tomasz Kociumaka, Marek Cygan, Anudhyan Boral, Marcin Pilipczuk
Publication date: 24 June 2014
Published in: Computer Science - Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.3877
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.)
Related Items
Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization, An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem, The maximum independent union of cliques problem: complexity and exact approaches, Improved approximation algorithms for hitting 3-vertex paths, A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths