20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

The Clique Algorithm - Ashay Dharwadker

English
2006-08-08
€19.44 €24.30

-20% with code BOOKS

In stock at our supplier

Shipping in 10-16 days

30-day return policy

We present a new polynomial-time algorithm for finding maximal cliques in graphs. As a corollary, we obtain new bounds on the famous Ramsey numbers in terms of the maximum and minimum vertex degrees of the corresponding Ramsey graphs. The algorithm finds a maximum clique in all known examples of graphs. In view of the importance of the P versus NP question, we ask if there exists a graph for which the algor ... Full description

You May Also Like

Description

We present a new polynomial-time algorithm for finding maximal cliques in graphs. As a corollary, we obtain new bounds on the famous Ramsey numbers in terms of the maximum and minimum vertex degrees of the corresponding Ramsey graphs. The algorithm finds a maximum clique in all known examples of graphs. In view of the importance of the P versus NP question, we ask if there exists a graph for which the algorithm cannot find a maximum clique. The algorithm is demonstrated by finding maximum cliques for several famous graphs, including two large benchmark graphs with hidden maximum cliques. We implement the algorithm in C++ and provide a demonstration program for Microsoft Windows.

More Information

Author Ashay Dharwadker
Publisher Institute of Mathematics
Release year 2006
Cover type Softcover
EAN 9781466391215
Write Your Own Review
You're reviewing: The Clique Algorithm
Your Rating:

Goodreads Reviews

€19.44 €24.30