Fixed-Parameter Algorithms for Cluster Vertex Deletion

DOI10.1007/978-3-540-78773-0_61zbMath1136.68465OpenAlexW2147466109MaRDI QIDQ5458573

Hannes Moser, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier

Publication date: 15 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_61

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Separator-based data reduction for signed graph balancing, Improved Algorithms for Bicluster Editing, Fixed-parameter enumerability of cluster editing and related problems, Fixed-parameter tractability results for feedback set problems in tournaments, Iterative compression and exact algorithms, Iterative Compression and Exact Algorithms, Iterative Compression for Exactly Solving NP-Hard Minimization Problems, Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms, Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover

Cites Work

• Unnamed Item
• Unnamed Item
• Finding odd cycle transversals.
• Graph-modeled data clustering: Exact algorithms for clique generation
• The node-deletion problem for hereditary properties is NP-complete
• Automated generation of search tree algorithms for hard graphs modification problems
• Cluster graph modification problems
• Parameterized Algorithms for Hitting Set: The Weighted Case
• Applying Modular Decomposition to Parameterized Bicluster Editing
• The Cluster Editing Problem: Implementations and Experiments
• Kernels: Annotated, Proper and Induced
• Kernelization Algorithms for d-Hitting Set Problems
• A More Effective Linear Kernelization for Cluster Editing
• The disjoint cliques problem
• Efficient Parameterized Preprocessing for Cluster Editing
• Going Weighted: Parameterized Algorithms for Cluster Editing
• Improved Parameterized Upper Bounds for Vertex Cover
• Aggregating inconsistent information