scientific article; zbMATH DE number 515922

From MaRDI portal

Revision as of 18:29, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4283434

Jump to:navigation, search

zbMath0787.90018MaRDI QIDQ4283434

Richard J. Anderson, João C. Setubal

Publication date: 10 March 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

maximum flow Goldberg's algorithm periodic global relabeling

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Software, source code, etc. for problems pertaining to computer science (68-04)

Related Items (7)

Recent developments in maximum flow algorithms ⋮ An auction algorithm for the max-flow problem ⋮ An efficient cost scaling algorithm for the assignment problem ⋮ On implementing push-relabel method for the maximum flow problem ⋮ A self-stabilizing algorithm for the maximum flow problem ⋮ Efficient preflow push algorithms ⋮ A compaction scheme and generator for distribution networks

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4283434&oldid=18207730"