Abstract
An optimal O(Δ log n/log n) parallel algorithm for 3-coloring of rooted trees with maximum degree Δ that uses n log log n/log n processors on a CRCW PRAM is presented. This algorithm is used in the design of optimal parallel algorithms for 7-coloring of planar graphs, finding a maximal independent set and a maximal matching in planar graphs.
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.
