论文信息 - Linear-Time Test for Small Face Covers in Any Fixed Surface

Linear-Time Test for Small Face Covers in Any Fixed Surface

For any fixed surface S and fixed integer $k \geqq 0$, a linear-time algorithm is presented that tests whether selected vertices of a graph drawn on S can be covered with k or fewer faces.

Daniel Bienstock | D. Bienstock

[1] David S. Johnson. The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.

[2] Clyde L. Monma,et al. On the Complexity of Covering Vertices by Faces in a Planar Graph , 1988, SIAM J. Comput..