The Independent Set Algorithm
Createspace Independent Publishing Platform
Paperback or Softback 46 pages Oct 02, 2011
(No reviews yet)
Write a Review
Write a Review
Createspace Independent Publishing Platform
The Independent Set Algorithm
Millions of titlesEvery book you're looking for
Carbon-neutral shippingFree on orders over $39.99
Fast shipping worldwideDelivered to your door
We present a new polynomial-time algorithm for finding maximal independent sets 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 independent set 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 independent set. The algorithm is demonstrated by finding maximum independent sets for several famous graphs, including two large benchmark graphs with hidden maximum independent sets. We implement the algorithm in C++ and provide a demonstration program for Microsoft Windows.
- Author:
- Ashay Dharwadker
- Publisher:
- Createspace Independent Publishing Platform
- Publication Date:
- Oct 02, 2011
- Number of pages:
- 46 pages
- Binding:
- Paperback or Softback
- ISBN-10:
- 1466387696
- ISBN-13:
- 9781466387690