In the mathematical discipline of graph theory a covering for a graph is a set of vertices (or edges) so that the elements of the set are close (adjacent) to all edges (or vertices) of the graph.We are especially interested in finding small sets with this property. The problem of finding the smallest vertex covering is called the vertex cover problem and is NP-complete.Coverings with vertices and edges are closely related to independent sets and matchings.
See more at Wikipedia.org...
Free Download Now!
