Efficient algorithms for acyclic colorings of graphs

Theoretical Computer Science

Volumn 230, Issue 1-2, 2000, Pages 75-95

  Chen, Zhi Zhong ^a  

^a TOKYO DENKI UNIVERSITY   (Japan)

Author keywords

Acyclic colorings; Parallel algorithms; Sparse graphs; Vertex arboricity

Indexed keywords

EID: 0005380450     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00254-5     Document Type: Article

References (16)

1. T. Asano, An approach to the subgraph homeomorphism problem, Theoret. Comput. Sci. 38 (1985) 249-267.
2. G. Chartrand, H.V. Kronk, The point-arboricity of planar graphs, J. London Math. Soc. 44 (1969) 612-616.
3. G. Chartrand, H.V. Kronk, C.E. Wall, The point-arboricity of a graph, Israel J. Math. 6 (1968) 169-175.
4. Z.-Z. Chen, NC algorithms for partitioning sparse graphs into induced forests with an application, in: Proc. 6th Internat. Symp. on Algorithms and Computation, Lecture Notes in Computer Science, vol. 1004, Springer, Berlin, 1995, pp. 428-437.
5. Z.-Z. Chen, X. He, Parallel complexity of partitioning a planar graph into vertex-induced forests, Discrete Appl. Math. 69 (1996) 183-198.
6. D. Fussell, V. Ramachandran, R. Thurimella, Finding triconnected components by local replacement, SIAM J. Comput. 22 (1993) 587-616.
7. M. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.
8. W. Goddard, acyclic colorings of planar graphs, Discrete Math. 91 (1991) 91-94.
9. A.V. Goldberg, S.A. Plotkin, G.E. Shannon, Parallel symmetry-breaking in sparse graphs, in: Proc. 19th ACM Symp. on Theory of Comput., ACM, New York, 1987, pp. 315-324.
10. A. Kanevsky, V. Ramachandran, Improved algorithms for graph four-connectivity, in: Proc. 28th IEEE Symp. on Foundations of Computer Science, IEEE, 1987, pp. 252-259.
11. 5 minor, in: Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, SIAM, 1992, pp. 345-356.
12. V. Ramachandran, J. Reif, An optimal parallel algorithm for graph planarity, in: Proc. 30th IEEE Symp. on Foundations of Computer Science, IEEE, 1989, pp. 282-287.
13. A. Roychoudhury, S. Sur-Kolay, Efficient algorithms for vertex arboricity of planar graphs, in: Proc. 15th Internat. Conf. on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, vol. 1026, Springer, Berlin, 1995, pp. 37-51.
14. Y. Shiloach, U. Vishkin, An O(log n) parallel connectivity algorithm, J. Algorithms 3 (1982) 57-67.
15. R.E. Tarjan, U. Vishkin, An efficient parallel biconnectivity algorithm, SIAM J. Comput. 14 (1985) 862-874.
16. M. Yannakakis, Node- and edge-deletion NP-complete problems, in: Proc. 10th ACM Symp. on Theory of Comput., ACM, 1978, pp. 253-264.