General vertex disjoint paths in series-parallel graphs

Authors:
Ephraim Korach;Ady Tal
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
1993

Citing 0
Cited 1

Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.07

Visualization

Abstract