Linear-time optimal augmentation for componentwise bipartite-completeness of graphs (Q1349750): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(94)00229-r / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2063653207 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:35, 30 July 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
