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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
