Approximate Max-Flow on Small Depth Networks

DOI10.1137/S0097539792236717MaRDI QIDQ4842122zbMATH OpenOpenAlexFDO

Authors 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

bipartite matchingblocking flowsdirected acyclic networksmaximum flow problemparallel algorithms

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1256703
• scientific article; zbMATH DE number 176498
• Parallel algorithms for the assignment and minimum-cost flow problems
• scientific article; zbMATH DE number 177817
• A new approach to the maximum-flow problem

Cited in

(7)

• scientific article; zbMATH DE number 176498 (Why is no real title available?)
• scientific article; zbMATH DE number 1256703 (Why is no real title available?)
• scientific article; zbMATH DE number 2086656 (Why is no real title available?)
• Unit Capacity Maxflow in Almost $m^{4/3}$ Time
• Matchability and \(k\)-maximal matchings
• Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique
• Maximum length-constrained flows and disjoint paths: distributed, deterministic, and fast

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4842122)