Code: 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 ... more
15.84 €
RRP: 16.15 €
You save 0.32 €
You get 40 loyalty points
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
15.84 €
Collection points Bratislava a 2642 dalších
Copyright ©2008-24 najlacnejsie-knihy.sk All rights reservedPrivacyCookies
Shopping cart ( Empty )
You are here: