Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph (original) (raw)
Related papers
An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs
Journal of Computing and Information Technology
Operations Research Letters, 2007
Finding disjoint paths with different path‐costs: Complexity and algorithms
Networks, 1992
A linear-time algorithm for edge-disjoint paths in planar graphs
Combinatorica, 1995
Finding Arc and Vertex-Disjoint Paths in Networks
2009 Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing, 2009
Edge-disjoint paths in planar graphs
Journal of Combinatorial Theory, Series B, 1985
A quick method for finding shortest pairs of disjoint paths
Networks, 1984
The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
Combinatorica, 2014
ACM Transactions on Algorithms, 2007
Note on the problem of partially link disjoint paths
Finding disjoint paths in networks
ACM SIGCOMM Computer Communication Review, 1991
Algorithms for finding internally disjoint paths in a planar graph
Electronics and Communications in Japan (Part III: Fundamental Electronic Science), 1989
Algorithms for determining a node-disjoint path pair visiting specified nodes
Optical Switching and Networking, 2016
CONSTRAINED DISJOINT PATHS IN GEOMETRIC NETWORKS
Constrained Disjoint Paths in Geometric Network
International Journal of Computational Intelligence and Applications, 2009
A linear programming formulation of Mader's edge-disjoint paths problem
Journal of Combinatorial Theory, Series B, 2006
Vertex Disjoint Paths in Upward Planar Graphs
Lecture Notes in Computer Science, 2014
The complexity of finding two disjoint paths with min-max objective function
Discrete Applied Mathematics, 1990
Hardness of the undirected edge-disjoint paths problem
2005
A software package of algorithms and heuristics for disjoint paths in Planar Networks
Discrete Applied Mathematics, 1999
Efficient heuristics for determining node-disjoint path pairs visiting specified nodes
Networks, 2017
A Polynomial Solution to the Undirected Two Paths Problem
Journal of the ACM, 1980
2 Disjoint Paths Problem in Oriented Mesh Network
Efficient Algorithms for k-Disjoint Paths Problems on DAGs
Lecture Notes in Computer Science, 2007
On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths
Algorithmica, 2019
Theory of Computing Systems, 2014
On paths, trails and closed trails in edge-colored graphs
A Blossom Algorithm for Maximum Edge-Disjoint T-Paths
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2020
2-Edge Connectivity in Directed Graphs
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014