An O(n 2 log n) parallel max-flow algorithm

Yossi Shiloach, U. V. (1982). An O(n 2 log n) parallel max-flow algorithm.

Type

Unclassified

Intellectual base

Unclassified

Year

1982

DOI

10.1016/0196-6774(82)90013-x

Link

https://doi.org/10.1016/0196-6774(82)90013-x

Cited by

1 citation across 1 artifact.

Domain-specific

• Analysis of parallel algorithms
  • Parallel analysis extends sequential complexity by distinguishing work from depth, applying scheduling bounds such as Brent's theorem, and measuring speedup, efficiency, cost, contention, locality, and communication across PRAM, circuits, BSP, distributed, and hardware models.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:a76b4387bdc9 · see in the full table