NC Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard Problems

Zhi-Zhong Chen, Xin He. NC Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard Problems. In Manfred Nagl, editor, Graph-Theoretic Concepts in Computer Science, 21st International Workshop, WG 95, Aachen, Germany, June 20-22, 1995, Proceedings. Volume 1017 of Lecture Notes in Computer Science, pages 275-289, Springer, 1995.

Abstract

Abstract is missing.