Linear-time optimal augmentation for componentwise bipartite-completeness of graphs (Q1349750): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the computational power of pushdown automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3691050 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4195901 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4023848 / rank | |||
Normal rank | |||
Revision as of 10:03, 27 May 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
