The complexity of finding maximum disjoint paths with length constraints

This publication has 7 references indexed in Scilit:

• An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1980
• An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
  Journal of the ACM, 1976
• Network Flow and Testing Graph Connectivity
  SIAM Journal on Computing, 1975
• An O (N2.5) algorithm for maximum matching in general graphs
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1975
• Disjoint paths in a network
  Networks, 1974
• Reducibility among Combinatorial Problems
  Published by Springer Nature ,1972
• The complexity of theorem-proving procedures
  Published by Association for Computing Machinery (ACM) ,1971