Sparsity in covering solutions
From MaRDI portal
Publication:6547950
Cites work
- A 4k^2 kernel for feedback vertex set
- A Note on the Vertex Arboricity of a Graph
- An improved FPT algorithm for independent feedback vertex set
- Circumventing connectivity for kernelization
- Conflict free feedback vertex set: a parameterized dichotomy
- Conflict free version of covering problems on graphs: classical and parameterized
- Faster deterministic \textsc{Feedback Vertex Set}
- scientific article; zbMATH DE number 1263950 (Why is no real title available?)
- scientific article; zbMATH DE number 1518742 (Why is no real title available?)
- scientific article; zbMATH DE number 7378380 (Why is no real title available?)
- Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set
- Independent domination in graphs: A survey and recent results
- Independent domination in outerplanar graphs
- Independent feedback vertex set for P₅-free graphs
- Independent feedback vertex sets for graphs of bounded diameter
- On parameterized independent feedback vertex set
- On the vertex arboricity of planar graphs of diameter two
- Parameterized algorithms
- Parameterized complexity of conflict-free matchings and paths
- Parameterized complexity of conflict-free set cover
- Parameterized complexity of geometric covering problems having conflicts
- Partition the vertices of a graph into one independent set and one acyclic set
- Vertex partitions into an independent set and a forest with each component small
This page was built for publication: Sparsity in covering solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547950)