A parallel algorithm for edge-coloring partial k-trees

  • Xiao Zhou
  • Shin-ichi Nakano
  • Takao Nishizeki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 824)


Many combinatorial problems can be efficiently solved for partial k-trees (graphs of treewidth bounded by k). The edge-coloring problem is one of the well-known combinatorial problems for which no NC algorithms have been obtained for partial k-trees. This paper gives an optimal and first NC parallel algorithm which finds an edge-coloring of a given partial k-tree using a minimum number of colors.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese, An algebraic theory of graph reduction, Journal of the Association for Computing Machinery, 40, 5, pp.1134–1164, 1993.Google Scholar
  2. [2]
    S. Arnborg and J. Lagergren, Easy problems for tree-decomposable graphs, Journal of Algorithms, 12, 2, pp.308–340, 1991.Google Scholar
  3. [3]
    H. L. Bodlaender, Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees, Journal of Algorithms, 11, 4, pp.631–643, 1990.Google Scholar
  4. [4]
    H. L. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, Proc. of the 25th Ann. ACM Symp. on Theory of Computing, pp.226–234, San Diego, CA, 1993.Google Scholar
  5. [5]
    R.B. Borie, R.G. Parker and C.A. Tovey, Automatic generation of lineartime algorithms from predicate calculus descriptions of problems on recursively constructed graph families, Algorithmica, 7, pp.555–581, 1992.CrossRefGoogle Scholar
  6. [6]
    B. Courcelle, The monadic second-order logic of graphs I: Recognizable sets of finite graphs, Information and Computation, 85, pp.12–75, 1990.CrossRefGoogle Scholar
  7. [7]
    Y. Caspi and E. Dekel, A near-optimal parallel algorithm for edge-coloring outerplanar graphs, manuscript, Computer Science Program, University of Texas at Dallas, Richardson, Tx., 1992.Google Scholar
  8. [8]
    M. Chrobak and T. Nishizeki, Improved edge-coloring algorithms for planar graphs, J. Algorithms, 11, pp.102–116, 1990.Google Scholar
  9. [9]
    S. Fiorini and R.J. Wilson, Edge-Colouring of Graphs, Pitman, London, 1977.Google Scholar
  10. [10]
    A. Gibbons and W. Rytter, Efficient Parallel Algorithms, Cambridge Univ. Press, Cambridge, 1988.Google Scholar
  11. [11]
    H. N. Gabow, T. Nishizeki, O. Kariv, D. Leven and O. Terada, Algorithm for edge-coloring graphs, Tech. Rep. TRECIS-8501, Tohoku Univ., 1985.Google Scholar
  12. [12]
    I.J. Holyer, The NP-completeness of edge-coloring, SIAM J. on Computing, 10, pp.718–720, 1981.Google Scholar
  13. [13]
    S. L. Hakimi and O. Kariv, On a generalization of edge-coloring in graphs, Journal of Graph Theory, 10, pp.139–154, 1986.Google Scholar
  14. [14]
    H. J. Karloff and D. B. Shmoys, Efficient parallel algorithms for edge-coloring problems, Journal of Algorithms, 8, pp.39–52, 1985.Google Scholar
  15. [15]
    T. Nishizeki and N. Chiba, Planar Graphs: Theory and Algorithms, North-Holland, Amsterdam, 1988.Google Scholar
  16. [16]
    S. Nakano, T. Nishizeki and N. Saito, On the f-coloring multigraphs, IEEE Transactions on Circuits and Systems, Vol. 35, No. 3, pp. 345–353, 1988.Google Scholar
  17. [17]
    B.A. Reed, Finding approximate separators and computing tree-width quickly, Proc. of the 24th Ann. ACM Symp. on Theory of Computing, pp. 221–228, 1992.Google Scholar
  18. [18]
    O. Terada and T. Nishizeki, Approximate algorithms for the edge-coloring of graphs, Trans. Inst. of Electronics and Communication Eng. of Japan, J65-D, 11, pp. 1382–1389, 1982.Google Scholar
  19. [19]
    K. Takamizawa, T. Nishizeki, and N. Saito, Linear-time computability of combinatorial problems on series-parallel graphs, Journal of the Association for Computing Machinery, 29, 3, pp. 623–641, 1982.Google Scholar
  20. [20]
    X. Zhou, S. Nakano and T. Nishizeki, A linear algorithm for edge-coloring partial k-trees, Proc. of First Europian Symposium on Algorithms, Lect. Notes in Computer Science, Springer-Verlag, 726, pp. 409–418, 1993.Google Scholar
  21. [21]
    X. Zhou, H. Suzuki and T. Nishizeki, Sequential and parallel algorithms for edge-coloring series-parallel multigraphs, Proc. of Third Conf. on Integer Programming and Combinatorial Optimization, pp. 129–145, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Xiao Zhou
    • 1
  • Shin-ichi Nakano
    • 1
  • Takao Nishizeki
    • 1
  1. 1.Department of System Information Sciences Graduate School of Information SciencesTohoku UniversitySendaiJapan

Personalised recommendations