Improved Parameterized Algorithms for Cluster Vertex Deletion

No abstract is available for this paper.

• Publication year

  2025

• Venue

  Theory of Computing Systems

• Publication date

  2025-11-11

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s00224-025-10247-6
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs

  2023cited by this paper
• Cluster deletion revisited

  2019cited by this paper
• Faster Parameterized Algorithm for Cluster Vertex Deletion

  2019influential reference
• Parameterized algorithm for 3-path vertex cover

  2018cited by this paper
• Correlation Clustering

  2017cited by this paper
• Exact algorithms via monotone local search

  2015cited by this paper
• A Fast Branching Algorithm for Cluster Vertex Deletion

  2013cited by this paper
• A golden ratio parameterized algorithm for Cluster Editing

  2011cited by this paper
• Fixed-Parameter Algorithms for Cluster Vertex Deletion

  2010cited by this paper
• Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms

  2009cited by this paper
• Going weighted: Parameterized algorithms for cluster editing

  2008cited by this paper
• Algorithms, measures and upper bounds for satisfiability and related problems

  2007cited by this paper
• Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems

  2004cited by this paper
• Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation

  2003cited by this paper
• Clustering Gene Expression Patterns

  1999cited by this paper
• Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties

  1996cited by this paper

• No citing papers are available for this paper.