Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation (Q3659168): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1109/tse.1983.234958 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2007113317 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:55, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation |
scientific article |
Statements
Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation (English)
0 references
1983
0 references
distributed computation
0 references
distributed graph algorithms
0 references
graph traversal techniques
0 references
maximum network flow problem
0 references
