Advertisement

NC algorithms for partitioning planar graphs into induced forests and approximating NP-hard problems

  • Zhi-Zhong Chen
  • Xin He
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1017)

Abstract

It is well known that the vertex set of every planar graph can be partitioned into three subsets each of which induces a forest. Previously, there has been no NC algorithm for computing such a partition. In this paper, we design an optimal NC algorithm for computing such a partition for a given planar graph. It runs in O(log n log*n) time using O(n/(log n log*n)) processors on an EREW PRAM. This algorithm implies optimal NC approximation algorithms for many NP-hard maximum induced subgraph problems on planar graphs with a performance ratio of 3. We also present optimal NC algorithms for partitioning the vertex set of a given K4-free or K2, 3-free graph into two subsets each of which induces a forest. As consequences,we obtain optimal NC algorithms for 4-coloring K4-free or K2, 3-free graphs which are previously unknown to our knowledge.

Keywords

Planar Graph Parallel Algorithm Performance Ratio Adjacency List Hamiltonian Circuit 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    T. Asano, An approach to the subgraph homeomorphism problem, Theoret. Comput. Sci. 38, 249–267 (1985).Google Scholar
  2. 2.
    B.S. Baker, Approximation algorithms for NP-complete problems on planar graphs, J. ACM 41, 153–180 (1994).Google Scholar
  3. 3.
    G. Chartrand, H.V. Kronk, and C.E. Wall, The point-arboricity of a graph, Israel J. Math. 6, 169–175 (1968).Google Scholar
  4. 4.
    G. Chartrand and H.V. Kronk, The point-arboricity of planar graphs, J. London Math. Soc. 44, 612–616 (1969).Google Scholar
  5. 5.
    G. Chartrand and L. Lesniak, Graphs and Digraphs (2nd ed.), (Wadsworth, Belmont, 1986).Google Scholar
  6. 6.
    R. Cole and U. Vishikin, Deterministic coin tossing with applications to optimal parallel list ranking, Inform. and Control 70, 32–53 (1986).CrossRefGoogle Scholar
  7. 7.
    H. Gazit, Optimal EREW parallel algorithms for connectivity, ear Decomposition and st-Numbering of planar graphs, in “Proceedings, 5th IEEE International Parallel Processing Symposium 1991,”; pp. 84–91.Google Scholar
  8. 8.
    W. Goddard, Acyclic colorings of graphs, Discrete Math. 91, 91–93 (1991).Google Scholar
  9. 9.
    T. Hagerup, M. Chrobak, and K. Diks, Optimal parallel 5-colouring of planar graphs, SIAM J. Comput. 18, 288–300 (1989).Google Scholar
  10. 10.
    X. He, Binary tree algebraic computation and parallel algorithms for simple graphs, J. Algorithms 9, 92–113 (1988).CrossRefGoogle Scholar
  11. 11.
    R. M. Karp and V. Ramachandran, “A survey of parallel algorithms for shared-memory machines,”; in “Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity,”; The MIT Press/Elsevier, 1990, 869–941.Google Scholar
  12. 12.
    P.N. Klein and S. Subramaniam, A linear-processor polylog-time algorithm for shortest paths in planar graphs, in: Proceedings of 31st IEEE Symposium on Foundations of Computer Science (IEEE, 1993) 173–182.Google Scholar
  13. 13.
    G.L. Miller and J.H. Reif, Parallel tree contraction and its applications, in: Proceedings of 26th IEEE Symposium on Foundations of Computer Science (IEEE, 1985) 478–489.Google Scholar
  14. 14.
    K.S. Poh, On the linear vertex-arboricity of a planar graph, J. Graph Theory 14, 73–75 (1990).Google Scholar
  15. 15.
    M. Yannakakis, Node-and edge-deletion NP-complete problems, in “Proceedings, 10th ACM Sympos. on Theory of Comput. 1978,”; pp. 253–264.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Zhi-Zhong Chen
    • 1
  • Xin He
    • 2
  1. 1.Dept. of Mathematical SciencesTokyo Denki UniversitySaitamaJapan
  2. 2.Dept. of Computer ScienceState Univ. of New York at BuffaloBuffaloUSA

Personalised recommendations