Fast Parallel Algorithms for Optimal Edge-Colouring of some Tree-structured Graphs

Alan Gibbons, Wojciech Rytter. Fast Parallel Algorithms for Optimal Edge-Colouring of some Tree-structured Graphs. In Lothar Budach, Rais Gatic Bakharajev, Oleg Borisovic Lipanov, editors, Fundamentals of Computation Theory, International Conference FCT 87, Kazan, USSR, June 22-26, 1987, Proceedings. Volume 278 of Lecture Notes in Computer Science, pages 155-162, Springer, 1987.

@inproceedings{GibbonsR87,
  title = {Fast Parallel Algorithms for Optimal Edge-Colouring of some Tree-structured Graphs},
  author = {Alan Gibbons and Wojciech Rytter},
  year = {1987},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/GibbonsR87},
  cites = {0},
  citedby = {0},
  pages = {155-162},
  booktitle = {Fundamentals of Computation Theory, International Conference FCT 87, Kazan, USSR, June 22-26, 1987, Proceedings},
  editor = {Lothar Budach and Rais Gatic Bakharajev and Oleg Borisovic Lipanov},
  volume = {278},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-18740-5},
}