Routing flow through a strongly connected graph (Q1348945): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-001-0082-y / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-001-0082-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W60910956 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-001-0082-Y / rank | |||
Normal rank | |||
Latest revision as of 18:34, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Routing flow through a strongly connected graph |
scientific article |
Statements
Routing flow through a strongly connected graph (English)
0 references
21 May 2002
0 references
binary blocking flow algorithm
0 references
