A Fast Branching Algorithm for Cluster Vertex Deletion
From MaRDI portal
Publication:4981153
DOI10.1007/978-3-319-06686-8_9zbMath1330.68220arXiv1306.3877OpenAlexW2570525280MaRDI 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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
The maximum independent union of cliques problem: complexity and exact approaches ⋮ A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths ⋮ Improved approximation algorithms for hitting 3-vertex paths ⋮ Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization ⋮ An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem
This page was built for publication: A Fast Branching Algorithm for Cluster Vertex Deletion
