Linear-time optimal augmentation for componentwise bipartite-completeness of graphs (Q1349750): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 14:00, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Linear-time optimal augmentation for componentwise bipartite-completeness of graphs |
scientific article |
Statements
Linear-time optimal augmentation for componentwise bipartite-completeness of graphs (English)
0 references
27 February 1997
0 references
design of algorithms
0 references
analysis of algorithms
0 references
combinatorial problems
0 references