Parallel Algorithms for Zero-One Supply-Demand Problems

DOI10.1137/0402012MaRDI QIDQ3833620zbMATH OpenOpenAlexFDO

Authors Noam Nisan, Danny Soroker

Publication date 1989

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/07983ca8846853d75dac520e645a9f142e52d42d

zbMATH Keywords

graph theorynetwork flowparallel computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10)

Recommendations

• Parallel algorithms for the assignment and minimum-cost flow problems
• A strongly polynomial time algorithm for the maximum supply rate problem on trees
• scientific article; zbMATH DE number 1163097
• Flow in Planar Graphs with Multiple Sources and Sinks
• A parallel blocking flow algorithm for acyclic networks

Cited in

(1)

• Optimal parallel construction of prescribed tournaments

This page was built for publication: Parallel Algorithms for Zero-One Supply-Demand Problems

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