Fast parallel algorithms for optimal edge-colouring of some tree-structured graphs

  • Alan Gibbons
  • Wojciech Rytter
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 278)


We show that every Halin and every outerplanar graph can be optimally edge-coloured in polylog time using a polynomial number of processors on a parallel random access machine without write conflicts (P-RAM). Our algorithms are designed using the divide and conquer technique in a parallel setting.


Outerplanar Graph Parallel Time Planar Embedding Consecutive Edge Biconnected Component 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    K.Diks. A fast parallel algorithm for six-colouring of planar graphs. Math. Found.of Computer Science,Bratislava,1986, Lect.Notes in Comp.ScienceGoogle Scholar
  2. [2]
    S. Fiorini and R.J. Wilson. Edge-colouring of graphs, Research Notes in Mathematics 16, Pitman, London 1977.Google Scholar
  3. [3]
    S. Fiorini. On the chromatic index of outerplanar graphs, J.Comb. Theory (B) 18 (1975), 35–38.Google Scholar
  4. [4]
    S.Fortune and J.Wyllie. Parallelism in random access machines, 10th ACM Symp.Theory of Computing (1978),114–118.Google Scholar
  5. [5]
    H. Gabow and O. Kariv. Algorithms for edge colouring bipartite graphs and multigraphs, SIAM J.Computing 11,1 (1982),117–129.Google Scholar
  6. [6]
    A. M. Gibbons and W. Rytter. A fast parallel algorithm for optimally edge-colouring outerplanar graphs. Report No.80. Dept.of Computer Science, University of Warwick.(1986).Google Scholar
  7. [7]
    I. Holyer. The NP-completeness of edge-colouring. SIAM J.Comp. 10 (1981) 718–720Google Scholar
  8. [8]
    J. Ja'Ja and J. Simon. Parallel algorithms in graph theory: planarity testing. SIAM J. Comp. 10 (1981) 718–720.Google Scholar
  9. [9]
    G.F. Lev, N. Pippenger and L.G. Valiant. A fast parallel algorithm for routing in permutation networks. IEEE Trans. on Computers, C-30,2 (1981),93–100.Google Scholar
  10. [10]
    A.Proskurowski and M.Syslo. Efficient vertex-and edge-colouring of outerplanar graphs. SIAM J.Algebraic and Discrete methods (1986).Google Scholar
  11. [11]
    M.Skowronska. Efficient vertex and edge colouring of Halin graphs. Proc.3rd Czechoslovak Symp. on Graph Theory, Praque 1982.Google Scholar
  12. [12]
    M.Syslo. NP-complete problems on some tree structured graphs: a review, WG'83 Intern. Workshop on Graph Theoretic Concepts in Comp.Science, (M.Nagl, J.Perl, editors) 342–353 (1983)Google Scholar
  13. [13]
    M.Syslo, A Proskurowski. On Halin graphs. Proc. Graph Theory, Lect. Notes on Math., Springer-Verlag (1983)Google Scholar
  14. [14]
    R.E. Tarjan, U. Vishkin. Finding biconnected components and computing tree functions in logarithmic parallel time. FOCS (1984) 12–20, also SIAM J.Computing 14:4 (1985),862–874Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Alan Gibbons
    • 1
  • Wojciech Rytter
    • 1
  1. 1.Department of Computer ScienceUniversity of WarwickCoventryEngland

Personalised recommendations