Scan barcode
46 pages • missing pub info (editions)
ISBN/UID: 9781466384477
Format: Paperback
Language: English
Publisher: Createspace Independent Publishing Platform
Publication date: 02 October 2011
Description
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 gra...
Community Reviews
Content Warnings
46 pages • missing pub info (editions)
ISBN/UID: 9781466384477
Format: Paperback
Language: English
Publisher: Createspace Independent Publishing Platform
Publication date: 02 October 2011
Description
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 gra...
Community Reviews
Content Warnings