An efficient algorithm for computing average network flow

DOI10.15807/JORSJ.69.39MaRDI QIDQ7321682zbMATH OpenFDO

Authors Yutaro Fuse, Tomomi Matsui, Nobutaka Shimizu, Akiyoshi Shioura

Publication date 28 August 2026

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/JORSJ.69.39

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• All-pairs max-flow is no harder than single-pair max-flow: Gomory-Hu trees in almost-linear time
• Counterexamples for Directed and Node Capacitated Cut-Trees
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Multi-Terminal Network Flows

This page was built for publication: An efficient algorithm for computing average network flow

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