Linear-time optimal augmentation for componentwise bipartite-completeness of graphs (Q1349750)
From MaRDI portal
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
