A polynomial time solvable instance of the feasible minimum cover problem (Q293433)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time solvable instance of the feasible minimum cover problem |
scientific article |
Statements
A polynomial time solvable instance of the feasible minimum cover problem (English)
0 references
9 June 2016
0 references
bipartite graph
0 references
maximum matching
0 references
vertex cover
0 references
polynomial time algorithm
0 references
