Abstract
Few existing parallel graph algorithms achieve optimality when applied to very sparse graphs such as planar graphs. We add to the list of such algorithms by giving optimal, logarithmic-time PRAM algorithms for the connected components, spanning tree, biconnected components, and strong orientation problems. The algorithms work on classes of graphs including planar graphs and graphs of bounded genus or bounded thickness.
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.
