Vertex-cover problem
Set of vertices incident on every edge
Nº Q924362 ★
Common · Knowledge
Vertex-cover problem
Set of vertices incident on every edge
Text: Wikipédia, CC BY-SA 4.0. · Image: Fschwarzentruber (CC BY-SA 4.0) ·
Related cards
-
M
Minimum-cost flow problem
Mathematical optimization problem
Nº Q2897180 ★
Not listed
-
Shortest path problem
Problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized
Nº Q1058754 ★★
Not listed
-
P versus NP problem
Unsolved problem in computer science about time complexity
Nº Q746242 ★★★★
Not listed
-
Change-making problem
The computational problem of choosing as few coins as possible that add up to a given amount of money
Nº Q3406279 ★
Not listed
-
Coupon collector's problem
Probability Theory
Nº Q1148012 ★★
Not listed
-
Knapsack problem
Problem in combinatorial optimization
Nº Q864457 ★★★
Not listed