Abstract
Thep-partitioning andp-coloring problems on a Bethe lattice of coordination numberz are analyzed. It is shown that these two NP-complete optimization problems turn out to be equivalent to finding the ground-state energy ofp-state Potts models with frustration. Numerical calculation of the cost function of both problems are carried out for several values ofz andp. In the case ofp=2 the results are identical to those obtained by Mezard and Parisi for the case of the bipartitioning problem. A numerical upper bound to the chromatic number is found for several values ofz.
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.
