Login / Signup
The complexity of finding maximum disjoint paths with length constraints.
Alon Itai
Yehoshua Perl
Yossi Shiloach
Published in:
Networks (1982)
Keyphrases
</>
disjoint paths
maximum number
worst case
directed graph
databases
computational complexity
decision problems
case study
search algorithm
co occurrence
constraint programming
undirected graph
fixed length
total length