Minimum covering algorithm on bipartite graph (Q3089510)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5942953
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum covering algorithm on bipartite graph |
scientific article; zbMATH DE number 5942953 |
Statements
25 August 2011
0 references
bipartite graph
0 references
maximum matching
0 references
minimum covering
0 references
König theorem
0 references
polynomial time algorithm
0 references
0.7988423705101013
0 references
0.7854315638542175
0 references
