A polynomial algorithm for the extendability problem in bipartite graphs (Q293170): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 23:56, 4 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm for the extendability problem in bipartite graphs |
scientific article |
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
