A bounded search tree algorithm for parameterized face cover
From MaRDI portal
Recommendations
- Parameterized and Exact Computation
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms
- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
- Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
- scientific article; zbMATH DE number 1953101
Cites work
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- A refined search tree technique for dominating set on planar graphs
- A top-down approach to search-trees: Improved algorithmics for 3-hitting set
- An efficient fixed-parameter algorithm for 3-hitting set
- Automata, Languages and Programming
- Deeply asymmetric planar graphs
- Exact algorithms for finding minimum transversals in rank-3 hypergraphs
- Mathematical Foundations of Computer Science 2004
- On the Complexity of Covering Vertices by Faces in a Planar Graph
- Parameterized and Exact Computation
- Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
- Refined memorization for vertex cover
- Two-Layer Planarization: Improving on Parameterized Algorithmics
Cited in
(4)
This page was built for publication: A bounded search tree algorithm for parameterized face cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1002098)