OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Vertex cover

 Home Mathematics Fields of mathematics Computational mathematics Computational problems in graph theory
 0 By others on same topic  0 Discussions  1970-01-01  See my version
In graph theory, a **vertex cover** of a graph is a set of vertices such that every edge in the graph is incident to at least one vertex from this set. In simpler terms, for every edge that connects two vertices, at least one of those vertices must be included in the vertex cover. The concept of a vertex cover is important in various areas of computer science, including optimization, network theory, and computational biology.

 Ancestors (5)

  1. Computational problems in graph theory
  2. Computational mathematics
  3. Fields of mathematics
  4. Mathematics
  5.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook