An improved algorithm for decomposing arc flows into multipath flows
From MaRDI portal
Publication:2583709
Recommendations
Cites work
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- scientific article; zbMATH DE number 961880 (Why is no real title available?)
- A Faster Deterministic Maximum Flow Algorithm
- Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems
- Dividing a Graph into Triconnected Components
- Flows over edge-disjoint mixed multipaths and applications
- Integer version of the multipath flow network synthesis problem
- Multi-terminal multipath flows: synthesis
- Network Flow and Testing Graph Connectivity
- Network flows. Theory, algorithms, and applications.
- On multiroute maximum flows in networks.
- The multiroute maximum flow problem revisited
Cited in
(5)- Integral flow decomposition with minimum longest path length
- Sensitivity analysis on the all pairs \(q\)-route flows in a network
- An approximation algorithm for multiroute flow decomposition
- Integer version of the multipath flow network synthesis problem
- A fast algorithm of constructing decomposition of multipole flows
This page was built for publication: An improved algorithm for decomposing arc flows into multipath flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583709)