Abstract
Abstract Given a graph, in the maximum clique problem one wants to and the largest number of vertices any two of which are adjacent. In the maximum-weight clique problem, the vertices have weights, and one wants to and a clique with maximum weight. A recently developed algorithm for the maximum clique problem is here transformed into an algorithm for the weighted case. Computational experiments with random graphs show that this new algorithm in many cases is faster than earlier algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.