An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs
References (5)
- et al.
Efficient parallel algorithms for permutation graphs
J. Parallel Distributed Comput.
(1995) Algorithmic Graph Theory and Perfect Graphs
(1980)
There are more references available in the full text version of this article.
Cited by (2)
Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time
2010, Information Processing LettersOptimal sequential and parallel algorithms to compute a steiner tree on permutation graphs
2003, International Journal of Computer Mathematics
Copyright © 1997 Published by Elsevier B.V.