Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization (Q3787764)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4051319
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization |
scientific article; zbMATH DE number 4051319 |
Statements
Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization (English)
0 references
1985
0 references
Maximum Flow
0 references
Breadth-First Search
0 references
asynchronous communication network
0 references
synchronous algorithms
0 references
0.7891047596931458
0 references
0.7847052812576294
0 references
0.7588432431221008
0 references
