The binary network flow problem is logspace complete for P (Q914388): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:14, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The binary network flow problem is logspace complete for P |
scientific article |
Statements
The binary network flow problem is logspace complete for P (English)
0 references
1990
0 references
logspace complete
0 references
maximum flow
0 references
