Fortæl dine venner om denne vare:
The Clique Algorithm
Ashay Dharwadker
Pris
DKK 186
Bestilles fra fjernlager
Forventes klar til forsendelse 21. - 28. maj.
Tilføj til din iMusic ønskeseddel
Eller
The Clique Algorithm
Ashay Dharwadker
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.
Medie | Bøger Paperback Bog (Bog med blødt omslag og limet ryg) |
Udgivet | 2. oktober 2011 |
ISBN13 | 9781466391215 |
Forlag | CreateSpace Independent Publishing Platf |
Antal sider | 46 |
Mål | 3 × 216 × 279 mm · 136 g |
Sprog | Engelsk |