Linear-time optimal augmentation for componentwise bipartite-completeness of graphs (Q1349750)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Linear-time optimal augmentation for componentwise bipartite-completeness of graphs |
scientific article; zbMATH DE number 983751
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear-time optimal augmentation for componentwise bipartite-completeness of graphs |
scientific article; zbMATH DE number 983751 |
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
