Approximate Max-Flow on Small Depth Networks

DOI10.1137/S0097539792236717zbMath0837.90041OpenAlexW2140097884MaRDI QIDQ4842122

Edith Cohen

Publication date: 26 July 1995

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539792236717

zbMATH Keywords

parallel algorithmsbipartite matchingmaximum flow problemdirected acyclic networksblocking flows

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Parallel numerical computation (65Y05) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Related Items (3)

Unit Capacity Maxflow in Almost $m^{4/3}$ Time ⋮ Matchability and \(k\)-maximal matchings ⋮ Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique

This page was built for publication: Approximate Max-Flow on Small Depth Networks