Parameterized complexity of three edge contraction problems with degree constraints
From MaRDI portal
Recommendations
- Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints
- On the parameterized complexity of maximum degree contraction problem
- On the Parameterized Complexity of Maximum Degree Contraction Problem.
- Parameterized edge dominating set in graphs with degree bounded by 3
- scientific article; zbMATH DE number 4202289
- Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs
- Parameterized Complexity of Edge Interdiction Problems
- The computational complexity of three graph problems for instances with bounded minors of constraint matrices
- An extremal problem on contractible edges in 3-connected graphs
- Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A 4k^2 kernel for feedback vertex set
- A generalization of Nemhauser and Trotter's local optimization theorem
- Chordal deletion is fixed-parameter tractable
- Contractibility and NP-completeness
- Contracting chordal graphs and bipartite graphs to paths and trees
- Contracting few edges to remove forbidden induced subgraphs
- Edge-Deletion Problems
- Edge-contraction problems
- Editing graphs to satisfy degree constraints: a parameterized approach
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
- Finding small separators in linear time via treewidth reduction
- Increasing the minimum degree of a graph by contractions
- Machine-based methods in parameterized complexity theory
- Non deterministic polynomial optimization problems and their approximations
- Obtaining a bipartite graph by contracting few edges
- Obtaining planarity by contracting few edges
- On the Amount of Nondeterminism and the Power of Verifying
- On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges
- On the parameterized complexity of multiple-interval graph problems
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
- On the structure of parameterized problems in NP
- Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints
- Parameterized complexity of finding regular induced subgraphs
- Parameterizing cut sets in a graph by the number of their components
- Parametrized complexity theory.
- The node-deletion problem for hereditary properties is NP-complete
- The parameterized complexity of editing graphs for bounded degeneracy
Cited in
(18)- Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints
- The complexity of degree anonymization by graph contractions
- An improved linear kernel for the cycle contraction problem
- Reducing the vertex cover number via edge contractions
- On the parameterized complexity of contraction to generalization of trees
- Contraction Blockers for Graphs with Forbidden Induced Paths
- On the parameterized complexity of maximum degree contraction problem
- Increasing the minimum degree of a graph by contractions
- Increasing the minimum degree of a graph by contractions
- Contracting to a longest path in H-free graphs
- On the Parameterized Complexity of Maximum Degree Contraction Problem.
- On the parameterized complexity of grid contraction
- Editing to Eulerian graphs
- A single exponential-time FPT algorithm for cactus contraction
- Editing to a planar graph of given degrees
- Editing to a planar graph of given degrees
- On the parameterized complexity of contraction to generalization of trees
- Graph editing problems with extended regularity constraints
This page was built for publication: Parameterized complexity of three edge contraction problems with degree constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q471188)
