A polynomial algorithm for the extendability problem in bipartite graphs (Q293170): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1969953447 / rank | |||
Normal rank | |||
Latest revision as of 08:37, 30 July 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
