The Vertex Cover Algorithm - Ashay Dharwadker
-30% ar kodu BOOKS
Piegāde 10-16 darba dienu laikā
30 dienu atgriešanas politika
We present a new polynomial-time algorithm for finding minimal vertex covers in graphs. The algorithm finds a minimum vertex cover 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 minimum vertex cover. The algorithm is demonstrated by finding minimum vertex covers for several famous graphs, including ... Pilns apraksts
Jums varētu patikt arī
Aprašymas
Vairāk informācijas
| Autors | Ashay Dharwadker |
|---|---|
| Izdevējs | Institute of Mathematics |
| Izlaides gads | 2006 |
| Vāka tips | Mīkstais vāks |
| EAN | 9781466384477 |