Editing graphs to satisfy degree constraints: a parameterized approach
From MaRDI portal
Publication:414866
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1341905 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A Short Proof of the Factor Theorem for Finite Graphs
- A note on the complexity of finding regular subgraphs
- An algorithmic proof of Tutte's f-factor theorem
- Antifactors of graphs
- Combinatorial optimization. Theory and algorithms.
- Deciding first-order properties of locally tree-decomposable structures
- Deciding whether a planar graph has a cubic subgraph is NP-complete
- Finding a -regular supergraph of minimum order
- Finding regular subgraphs in both arbitrary and planar graphs
- General antifactors of graphs
- General factors of graphs
- Graph factors
- Induced matchings
- Kernels: Annotated, Proper and Induced
- Matching theory
- Maximum \(k\)-regular induced subgraphs
- NP-completeness of some generalizations of the maximum matching problem
- On locating cubic subgraphs in bounded-degree connected bipartite graphs
- On the fixed-parameter tractability of parameterized model-checking problems
- 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
- Parameterized Graph Editing with Chosen Vertex Degrees
- Parameterized complexity of finding regular induced subgraphs
- Parametrized complexity theory.
- Paths, Trees, and Flowers
- Spanning subgraphs with specified valencies
- The complexity of regular subgraph recognition
- The factorization of graphs. II
- Three‐regular subgraphs of four‐regular graphs
- Tight lower bounds for certain parameterized NP-hard problems
Cited in
(35)- Editing graphs to satisfy diversity requirements
- Temporal reachability minimization: delaying vs. deleting
- Editing to a connected graph of given degrees
- A parameterized algorithmics framework for degree sequence completion problems in directed graphs
- Parameterized Graph Editing with Chosen Vertex Degrees
- Almost induced matching: linear kernels and parameterized algorithms
- The complexity of degree anonymization by graph contractions
- An improved linear kernel for the cycle contraction problem
- Fixed-parameter tractable distances to sparse graph classes
- Parameterized algorithms and kernels for almost induced matching
- Win-win kernelization for degree sequence completion problems
- How hard is safe bribery?
- Prices matter for the parameterized complexity of shift bribery
- Parameterized complexity of firefighting
- A survey of parameterized algorithms and the complexity of edge modification
- Building large \(k\)-cores from sparse graphs
- Parameterized complexity of three edge contraction problems with degree constraints
- Building large \(k\)-cores from sparse graphs
- Disconnected matchings
- Circulant graphs and GCD and LCM of subsets
- The complexity of gerrymandering over graphs: paths and trees
- The complexity of gerrymandering over graphs: paths and trees
- The parameterized complexity of editing graphs for bounded degeneracy
- An improved kernel and parameterized algorithm for almost induced matching
- Graph editing to a given degree sequence
- Graph editing to a given degree sequence
- Trimming forests is hard (unless they are made of stars)
- Editing to Eulerian graphs
- A refined complexity analysis of degree anonymization in graphs
- Editing to Connected F-Degree Graph
- Editing to a planar graph of given degrees
- Editing to a planar graph of given degrees
- Graph editing to a given neighbourhood degree list is fixed-parameter tractable
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
- Graph editing problems with extended regularity constraints
This page was built for publication: Editing graphs to satisfy degree constraints: a parameterized approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414866)
