Vertex cover
Vertex cover
Subset of a graph's vertices, including at least one endpoint of every edge.
No account needed. By playing, you confirm you're 13 or older and agree to the Terms of use.
No owners yet
Category: Empty
- 0 owners
- 0 copies
- 0 pulls
- Wishlisted
- 0
- In 0 albums
- On 0 showcases
- Market listings
- 0
Not sold on the market yet.
Readers' pathsAug 2026 – Oct 2026
Readers go next to
Share of the 671 clicks on its links
Dominating set
Subset of a graph's nodes such that all other nodes link to at least one.
9.8%
Kőnig's theorem (graph theory)
On bipartite matching and vertex cover.
9.2%
NP-hardness
Complexity class.
6.9%
Independent set (graph theory)
Unrelated vertices in graphs.
6.6%
Set cover problem
Classical problem in combinatorics.
3.9%
Vertex cover in hypergraphs
Set of hypergraph nodes to which every hyperedge is connected.
2.2%
NP-completeness
Complexity class.
2.1%
Time complexity
Estimate of time taken for running an algorithm.
1.6%
Readers come from
Share of the 882 readers arriving from another article
Kőnig's theorem (graph theory)
On bipartite matching and vertex cover.
20%
NP-completeness
Complexity class.
11%
Independent set (graph theory)
Unrelated vertices in graphs.
7.4%
Set cover problem
Classical problem in combinatorics.
7.1%
Integer programming
Mathematical optimization problem restricted to integers.
6.7%
Bipartite graph
Graph divided into two independent sets.
5.2%
Reduction (complexity)
Transformation of one computational problem to another.
2.8%