Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
From MaRDI portal
Publication:3656854
DOI10.1007/978-3-642-11269-0_8zbMath1273.68426OpenAlexW1520824195MaRDI QIDQ3656854
Publication date: 14 January 2010
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11269-0_8
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
Cluster Editing ⋮ Parameterized algorithms for min-max 2-cluster editing ⋮ The cluster deletion problem for cographs ⋮ A golden ratio parameterized algorithm for cluster editing ⋮ Algorithms for 2-club cluster deletion problems using automated generation of branching rules ⋮ Even faster parameterized cluster deletion and cluster editing ⋮ Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions ⋮ Cluster deletion revisited ⋮ An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem
Cites Work
- Unnamed Item
- Unnamed Item
- Graph-modeled data clustering: Exact algorithms for clique generation
- Fixed-parameter enumerability of cluster editing and related problems
- On two techniques of combining branching and treewidth
- The union of minimal hitting sets: parameterized combinatorial bounds and counting
- Pathwidth of cubic graphs and exact algorithms
- Automated generation of search tree algorithms for hard graphs modification problems
- Cluster graph modification problems
- The Cluster Editing Problem: Implementations and Experiments
- Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants
- Improved Upper Bounds for Partial Vertex Cover
- Fixed-Parameter Algorithms for Cluster Vertex Deletion
- Going Weighted: Parameterized Algorithms for Cluster Editing
This page was built for publication: Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
