Vertex cover and feedback vertex set above and below structural guarantees
From MaRDI portal
Cites work
- A randomized polynomial kernelization for vertex cover with a smaller parameter
- Almost 2-SAT is fixed-parameter tractable
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
- Bridge-depth characterizes which structural parameterizations of vertex cover admit a polynomial kernel
- Call routing and the ratcatcher
- Complexity results for well‐covered graphs
- Efficient recognition of equimatchable graphs
- Elimination distances, blocking sets, and kernels for Vertex Cover
- Faster parameterized algorithms using linear programming
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Fundamentals of parameterized complexity
- Graph minors. X: Obstructions to tree-decomposition
- Graph theory
- scientific article; zbMATH DE number 434906 (Why is no real title available?)
- scientific article; zbMATH DE number 3873377 (Why is no real title available?)
- Improved analysis of highest-degree branching for feedback vertex set
- Improved upper bounds for vertex cover
- Independent domination in graphs: A survey and recent results
- Kernelization Lower Bounds by Cross-Composition
- Kernelization. Theory of parameterized preprocessing
- Linearity of grid minors in treewidth with applications through bidimensionality
- Matching theory
- Maximum induced matchings close to maximum matchings
- On multiway cut parameterized above lower bounds
- On the hardness of losing width
- On two extensions of equimatchable graphs
- Parameterized algorithms
- Parameterized complexity of finding subgraphs with hereditary properties.
- Parameterizing above Guaranteed Values: MaxSat and MaxCut
- Parametrized complexity theory.
- Polynomial kernels for vertex cover parameterized by small degree modulators
- Quickly excluding a planar graph
- Raising the bar for \textsc{Vertex Cover}: fixed-parameter tractability above a higher guarantee
- Representative sets and irrelevant vertices: new tools for kernelization
- Some covering concepts in graphs
- Testing for Equality between Maximum Matching and Minimum Node Covering
- The graphs with maximum induced matching and maximum matching the same size
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
- WELL-COVERED GRAPHS: A SURVEY
This page was built for publication: Vertex cover and feedback vertex set above and below structural guarantees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6968993)
