Abstract
Answering a question of Krivelevich and Vu [M. Krivelevich, V.H. Vu, Approximating the independence number and the chromatic number in expected polynomial time, J. Combin. Optimization 6 (2002) 143–155], we present an algorithm for approximating the chromatic number of random graphs G n , p within a factor of O ( n p / ln ( n p ) ) in polynomial expected time. The algorithm applies to edge probabilities c 0 / n ⩽ p ⩽ 0.99 , where c 0 > 0 is a certain constant.
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.
