A polynomial algorithm for the extendability problem in bipartite graphs (Q293170)
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 6590657
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial algorithm for the extendability problem in bipartite graphs |
scientific article; zbMATH DE number 6590657 |
Statements
A polynomial algorithm for the extendability problem in bipartite graphs (English)
0 references
9 June 2016
0 references
graph theory
0 references
perfect matching
0 references
extendability
0 references
connectivity
0 references
0.8449561595916748
0 references
0.8199402093887329
0 references
0.8124321699142456
0 references
