Back to search
An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks
Data up to Jan 2025
Published1985
Citations40
References10
Total Citations Per Year
Abstract
References (10)
A note on two problems in connexion with graphs
1959 • 22,492 citations
The Design and Analysis of Computer Algorithms
1974 • 9,688 citations
Maximal Flow Through a Network
1956 • 2,167 citations
A data structure for dynamic trees
1983 • 1,066 citations
Decomposition of Km,n(Km,n∗) into cycles (circuits) of length 2k
1981 • 174 citations
Maximum Flow in Planar Networks
1979 • 125 citations
Maximum flow in (s,t) planar networks
1981 • 108 citations
Two-Commodity Flow
1978 • 78 citations
Two commodity network flows and linear programming
1973 • 30 citations
Bi-Path Networks and Multicommodity Flows
1964 • 19 citations
Cited By (0)
Loading...