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.02 €
Bežne: 15.13 €
Ušetríte 1.11 €

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.02 €
Angličtina
Collection points Bratislava a 13250 dalších
Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies
26504 collection points
Delivery 2.99 €
02/210 210 99 (8-15.30h)Shopping cart ( Empty )
You are here: