Two-Commodity Flow

Authors:
Alon Itai
Affiliations:
Computer Science Department, Technion-Israel Institute of Technology, Haifa, Israel
Venue:
Journal of the ACM (JACM)
Year:
1978

Citing 3
Cited 6

Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows

Journal of the ACM (JACM)
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)
On the Structure of Polynomial Time Reducibility

Journal of the ACM (JACM)

Algorithms and complexity analysis for some flow problems

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
An Empirical Study of Off-Line Permutation Packet Routing on Two-Dimensional Meshes Based on the Multistage Routing Method

IEEE Transactions on Computers
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width

Journal of Algorithms
Improved quasi-path restoration in mesh networks

IEEE/ACM Transactions on Networking (TON)
A new strategy for the undirected two-commodity maximum flow problem

Computational Optimization and Applications
Linear programming

Algorithms and theory of computation handbook

Quantified Score

Hi-index	0.01

Visualization

Abstract