A direct algorithm for the parameterized face cover problem
From MaRDI portal
Recommendations
- A bounded search tree algorithm for parameterized face cover
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms
- New algorithms for k-face cover, k-feedback vertex set, and k-disjoint cycles on plane and planar graphs
- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
- Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
Cited in
(6)- A bounded search tree algorithm for parameterized face cover
- Linear-Time Test for Small Face Covers in any Fixed Surface
- On the Complexity of Covering Vertices by Faces in a Planar Graph
- New algorithms for k-face cover, k-feedback vertex set, and k-disjoint cycles on plane and planar graphs
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms
- Planarizing graphs and their drawings by vertex splitting
This page was built for publication: A direct algorithm for the parameterized face cover problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311513)