Roman cycle hitting set
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 512804 (Why is no real title available?)
- scientific article; zbMATH DE number 1523751 (Why is no real title available?)
- (Meta) kernelization
- A quadratic kernel for feedback vertex set
- An improved FPT algorithm for independent feedback vertex set
- Conflict free feedback vertex set: a parameterized dichotomy
- Designing FPT algorithms for cut problems using randomized contractions
- Detecting Feedback Vertex Sets of Size k in O ⋆ (2.7 k ) Time
- FPT algorithms for connected feedback vertex set
- Faster parameterized algorithms using linear programming
- Finding odd cycle transversals.
- Finding topological subgraphs is fixed-parameter tractable
- Graph theory
- Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set
- Improved analysis of highest-degree branching for feedback vertex set
- Linear time parameterized algorithms for \textsc{Subset Feedback Vertex Set}
- On group feedback vertex set parameterized by the size of the cutset
- On parameterized independent feedback vertex set
- R<scp>OMAN DOMINATION</scp>: a parameterized perspective†
- Reducing CMSO model checking to highly connected graphs
- Simultaneous feedback vertex set: a parameterized perspective
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- The minimum k-way cut of bounded size is fixed-parameter tractable
- Topics in Domination in Graphs
This page was built for publication: Roman cycle hitting set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988712)
