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... This description may be from another edition of this product.