A fast algorithm for maximum integral two-commodity flow in planar graphs
Authors:
Ephraim Korach;Michal Penn
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
1993
Citing
0
Cited
1
Disjoint paths in sparse graphs
Discrete Applied Mathematics
Quantified Score
Hi-index
0.04
Visualization
Abstract