Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width
From MaRDI portal
Publication:2912734
DOI10.1007/978-3-642-32589-2_32zbMath1365.68278OpenAlexW9893930MaRDI QIDQ2912734
Publication date: 25 September 2012
Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32589-2_32
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (24)
Iterated Type Partitions ⋮ Structural parameterizations for boxicity ⋮ Kernelization using structural parameters on sparse graph classes ⋮ On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering ⋮ The Firefighter Problem: A Structural Analysis ⋮ A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths ⋮ Structural parameterization of cluster deletion ⋮ Grouped domination parameterized by vertex cover, twin cover, and beyond ⋮ Parameterized complexity for iterated type partitions and modular-width ⋮ Dominator coloring and CD coloring in almost cluster graphs ⋮ FPT and kernelization algorithms for the induced tree problem ⋮ On 2-clubs in graph-based data clustering: theory and algorithm engineering ⋮ A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths ⋮ Complexity of conflict-free colorings of graphs ⋮ On the parameterized complexity of computing balanced partitions in graphs ⋮ Approximate association via dissociation ⋮ The firefighter problem: further steps in understanding its complexity ⋮ Constant thresholds can make target set selection tractable ⋮ Parameterized aspects of triangle enumeration ⋮ When can graph hyperbolicity be computed in linear time? ⋮ Parameterized algorithms for conflict-free colorings of graphs ⋮ Measuring what matters: a hybrid approach to dynamic programming with treewidth ⋮ Open Problems on Graph Coloring for Special Graph Classes ⋮ Offensive alliances in graphs
This page was built for publication: Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width
