Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs

Christos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter. Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs. In Kesav V. Nori, C. E. Veni Madhavan, editors, Foundations of Software Technology and Theoretical Computer Science, Tenth Conference, Bangalore, India, December 17-19, 1990, Proceedings. Volume 472 of Lecture Notes in Computer Science, pages 204-214, Springer, 1990.

@inproceedings{LevcopoulosLPR90,
  title = {Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs},
  author = {Christos Levcopoulos and Andrzej Lingas and Ola Petersson and Wojciech Rytter},
  year = {1990},
  tags = {testing, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/LevcopoulosLPR90},
  cites = {0},
  citedby = {0},
  pages = {204-214},
  booktitle = {Foundations of Software Technology and Theoretical Computer Science, Tenth Conference, Bangalore, India, December 17-19, 1990, Proceedings},
  editor = {Kesav V. Nori and C. E. Veni Madhavan},
  volume = {472},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-53487-3},
}