The Independent Set Algorithm
ago 2006 · Institute of Mathematics
5,0star
1 recensionereport
Ebook
50
pagine
reportValutazioni e recensioni non sono verificate Scopri di più
Informazioni su questo ebook
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.
Valutazioni e recensioni
5,0
1 recensione
Informazioni sull'autore
Ashay Dharwadker is the Distinguished Professor of Mathematics & Natural Sciences at the Institute of Mathematics, Gurgaon, India. He is the author of a dozen exquisitely illustrated books describing his fundamental contributions to combinatorics, graph theory, computer science and the foundations of physics.
Valuta questo ebook
Dicci cosa ne pensi.
Informazioni sulla lettura
Smartphone e tablet
Installa l'app Google Play Libri per Android e iPad/iPhone. L'app verrà sincronizzata automaticamente con il tuo account e potrai leggere libri online oppure offline ovunque tu sia.
Laptop e computer
Puoi ascoltare gli audiolibri acquistati su Google Play usando il browser web del tuo computer.
eReader e altri dispositivi
Per leggere su dispositivi e-ink come Kobo e eReader, dovrai scaricare un file e trasferirlo sul dispositivo. Segui le istruzioni dettagliate del Centro assistenza per trasferire i file sugli eReader supportati.
