Kód: 17062923
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 t ... celý popis
Angličtina
14.04 €
Bežne: 15.16 €
Ušetríte 1.12 €

Nákupom získate 34 bodov
Anotácia knihy
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 wh
Parametre knihy
14.04 €
Angličtina
Osobný odber Bratislava a 13222 dalších
Copyright ©2008-26 najlacnejsie-knihy.sk Všetky práva vyhradenéSúkromieCookies
24 miliónov titulov
Vrátenie do mesiaca
02/210 210 99 (8-15.30h)Nákupný košík ( prázdny )
Nachádzate sa: