Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

vertex cover · Vinony

🌐English

English Bahasa Indonesia Deutsch Español Français Italiano Nederlands Polski Português Русский العربية فارسی 中文日本語

EntityQ11515519· pop 15· linked from 85 articles

vertex cover

Also known as node cover

a set of vertices that includes at least one endpoint of every edge in a graph

Wikidata facts

Image: Vertex-cover.svg

Sources (2)

wikidata.org
docs.openalex.org

via Wikidata · CC0

Available in 15 languages

Español
Français
Deutsch
日本語
Русский
Português
Italiano
العربية
Bahasa Indonesia
Czech

Connections

linear programming

Categories

Computational problems in graph theory Covering problems NP-complete problems

Sources

wikipedia.externallinksexternallink

via Wikidata sitelinks · CC0

P versus NP problem

Entity

time complexity

parameterized complexity

computer science

International Standard Book Number

digital object identifier

Dartmouth College

binary search algorithm

computational complexity theory

Sign in to save

What links here85 pages

König's theorem

parameterized complexity

maximal independent set

set cover problem

linear programming

river crossing puzzle

bin packing problem

integer programming

complete bipartite graph

bipartite graph

2-satisfiability

computational complexity theory

exponential time hypothesis

George Nemhauser

mathematical chess problem

Karp's 21 NP-complete problems

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

induced subgraph

Entitydist 0.49

symmetric graph

Entitydist 0.49

Entitydist 0.49

Entitydist 0.50

distance-regular graph

Entitydist 0.52

Entitydist 0.53

Entitydist 0.54

Entitydist 0.56

undirected graph

Entitydist 0.57

Entitydist 0.57

self-complementary graph

Entitydist 0.59

Entitydist 0.60