Heuristics for finding a maximum number of disjoint bounded paths

This publication has 6 references indexed in Scilit:

• The complexity of finding maximum disjoint paths with length constraints
  Networks, 1982
• Network flow and generalized path compression
  Published by Association for Computing Machinery (ACM) ,1979
• A new algorithm for the maximal flow problem
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1978
• Network Flow and Testing Graph Connectivity
  SIAM Journal on Computing, 1975
• Disjoint paths in a network
  Networks, 1974
• An Algorithm for Vertex-pair Connectivity
  International Journal of Control, 1967