A polynomial time solvable instance of the feasible minimum cover problem (Q293433)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polynomial time solvable instance of the feasible minimum cover problem |
scientific article; zbMATH DE number 6590786
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time solvable instance of the feasible minimum cover problem |
scientific article; zbMATH DE number 6590786 |
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
0.8066670894622803
0 references
0.780236542224884
0 references
0.7721796631813049
0 references
0.7712018489837646
0 references
