DOIAbstract
AbstractWe describe an algorithm, which for fixed k ≥ 0 has running time O(|V(G)|3), to solve the following problem: given a graph G and k pairs of vertices of G, decide if there are k mutually vertex-disjoint paths of G joining the pairs
AbstractWe describe an algorithm, which for fixed k ≥ 0 has running time O(|V(G)|3), to solve the following problem: given a graph G and k pairs of vertices of G, decide if there are k mutually vertex-disjoint paths of G joining the pairs
The well-known Disjoint Paths problem is to decide if a graph contains k pairwise disjoint paths, e...
Paths P1,…,Pk in a graph G=(V,E) are mutually induced if any two distinct Pi and Pj have neither com...
Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t ...
The k-Disjoint Paths problem, which takes as input a graph G and k pairs of specified vertices (s i ...
The k-Disjoint Paths problem, which takes as input a graph G and k pairs of specified vertices (s i ...
AbstractWe consider the following well-known problem, which is called the disjoint paths problem. Fo...
Paths P1,…,Pk are mutually induced if any two distinct Pi and Pj have neither common vertices nor ad...
AbstractWe show that the l vertex disjoint paths problem between l pairs of vertices can be solved i...
Paths P1,…,Pk in a graph G = (V,E) are said to be mutually induced if for any 1 ≤ i < j ≤ k, Pi and ...
Paths P1,…,Pk in a graph G = (V,E) are said to be mutually induced if for any 1 ≤ i < j ≤ k, Pi and ...
AbstractFor a graph G and a collection of vertex pairs {(s1,t1),…,(sk,tk)}, the k disjoint paths pro...
Paths P1,…,Pk in a graph G=(V,E) are mutually induced if any two distinct Pi and Pj have neither com...
The classical disjoint shortest path problem has recently recalled interests from researchers in the...
Paths P1,…,Pk in a graph G = (V,E) are said to be mutually induced if for any 1 ≤ i < j ≤ k, Pi and ...
Paths P1,…,Pk in a graph G = (V,E) are said to be mutually induced if for any 1 ≤ i < j ≤ k, Pi and ...
The well-known Disjoint Paths problem is to decide if a graph contains k pairwise disjoint paths, e...
Paths P1,…,Pk in a graph G=(V,E) are mutually induced if any two distinct Pi and Pj have neither com...
Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t ...
The k-Disjoint Paths problem, which takes as input a graph G and k pairs of specified vertices (s i ...
The k-Disjoint Paths problem, which takes as input a graph G and k pairs of specified vertices (s i ...
AbstractWe consider the following well-known problem, which is called the disjoint paths problem. Fo...
Paths P1,…,Pk are mutually induced if any two distinct Pi and Pj have neither common vertices nor ad...
AbstractWe show that the l vertex disjoint paths problem between l pairs of vertices can be solved i...
Paths P1,…,Pk in a graph G = (V,E) are said to be mutually induced if for any 1 ≤ i < j ≤ k, Pi and ...
Paths P1,…,Pk in a graph G = (V,E) are said to be mutually induced if for any 1 ≤ i < j ≤ k, Pi and ...
AbstractFor a graph G and a collection of vertex pairs {(s1,t1),…,(sk,tk)}, the k disjoint paths pro...
Paths P1,…,Pk in a graph G=(V,E) are mutually induced if any two distinct Pi and Pj have neither com...
The classical disjoint shortest path problem has recently recalled interests from researchers in the...
Paths P1,…,Pk in a graph G = (V,E) are said to be mutually induced if for any 1 ≤ i < j ≤ k, Pi and ...
Paths P1,…,Pk in a graph G = (V,E) are said to be mutually induced if for any 1 ≤ i < j ≤ k, Pi and ...
The well-known Disjoint Paths problem is to decide if a graph contains k pairwise disjoint paths, e...
Paths P1,…,Pk in a graph G=(V,E) are mutually induced if any two distinct Pi and Pj have neither com...
Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t ...
Add to ORKG