scientific article; zbMATH DE number 1151794

MaRDI QIDQ4387700zbMATH OpenFDO

Authors Farhad Shahrokhi, László A. Székely

Publication date 10 August 1998

zbMATH Keywords

algorithmCartesian product graphmesh productproduct graphsuniform concurrent multicommodity flow

Mathematics Subject Classification ID

Graph theory (05C99) Deterministic network models in operations research (90B10) Linear programming (90C05)

Recommendations

• scientific article; zbMATH DE number 861340
• Sparsest cuts and concurrent flows in product graphs.
• scientific article; zbMATH DE number 1262804
• Approximation Algorithms for the Maximum Concurrent Flow Problem

Cited in

(6)

• Sparsest cuts and concurrent flows in product graphs.
• Trader multiflow and box-TDI systems in series-parallel graphs
• scientific article; zbMATH DE number 3914356 (Why is no real title available?)
• scientific article; zbMATH DE number 1262804 (Why is no real title available?)
• scientific article; zbMATH DE number 861340 (Why is no real title available?)
• Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem

This page was built for publication:

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