Abstract
We show that isomorphism of trees and outerplanar graphs can be tested in O(log n) time with n/log(n) processors on a CRCW PRAM and in O(log2n) time with n/log2n processors on an EREW PRAM. This gives the first optimal parallel algorithm for the isomorphism testing for a nontrivial class of graphs . We give also an optimal parallel algorithm for the equivalence of expressions. A related result is a general optimal and very simple parallel method of tree compression which can be applied for other problems.
Cite
CITATION STYLE
Levcopouios, C., Lingas, A., Petersson, O., & Rytter, W. (1990). Optimal parallel algorithms for testing isomorphism of trees and outerplanar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 472 LNCS, pp. 204–214). Springer Verlag. https://doi.org/10.1007/3-540-53487-3_45
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
