Abstract
The following EREW PRAM algorithms for edge-colouring a general graph are presented: 1. an algorithm that finds a ( Δ+ d)-edge-colouring, 1⩽ d< Δ, in O(( log d+(Δ/d) 4) log 2 n) time, using n+ m processors; 2. an algorithm that finds a Δ 1+ ε -edge-colouring, 0< ε<1, in O( log Δ log ∗ n) time, using nΔ 1+ ε processors.
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.
