AbstractWe prove: The directed edge-disjoint paths problem is NP-complete, even if (a) the underlying graph G is acyclic, the demand graph H consists just of three sets of parallel edges and G + H is Eulerian, or (b) G + H is planar, or (c) G is planar and acyclic. (d) The undirected edge-disjoint paths problem is NP-complete, even if G + H is Eulerian and H consists just of three sets of parallel edges
Consider a network G = (V,E) with distinguished vertices s and t, and with k different costs on ever...
AbstractIt is widely believed that showing a problem to be NP-complete is tantamount to proving its ...
Abstract. Graph packing and partitioning problems have been studied in many contexts, includ-ing fro...
AbstractWe prove: The directed edge-disjoint paths problem is NP-complete, even if (a) the underlyin...
We prove that the edge-disjoint paths problem is NP-complete even when restricted to series-parallel...
AbstractWe show that the edge disjoint paths problem is NP-complete in directed or undirected rectan...
Given a graph and pairs s i t i of terminals, the edge-disjoint paths problem is to determine whethe...
Given a graph and terminal pairs (si, ti), i ∈ [k], the edge-disjoint paths problem is to determine ...
AbstractMany combinatorial problems are NP-complete for general graphs. However, when restricted to ...
International audienceWe prove the NP-completeness of the integer multiflow problem in planar graphs...
AbstractWe show that the l vertex disjoint paths problem between l pairs of vertices can be solved i...
AbstractThe min–min problem of finding a disjoint path pair with the length of the shorter path mini...
AbstractThe H-decomposition problem for a fixed graph H is stated as follows: Can an input graph G b...
AbstractMany combinatorial problems are NP-complete for general graphs. However, when restricted to ...
In 2003, it was claimed that the following problem was solvable in polynomial time: do there exist k...
Consider a network G = (V,E) with distinguished vertices s and t, and with k different costs on ever...
AbstractIt is widely believed that showing a problem to be NP-complete is tantamount to proving its ...
Abstract. Graph packing and partitioning problems have been studied in many contexts, includ-ing fro...
AbstractWe prove: The directed edge-disjoint paths problem is NP-complete, even if (a) the underlyin...
We prove that the edge-disjoint paths problem is NP-complete even when restricted to series-parallel...
AbstractWe show that the edge disjoint paths problem is NP-complete in directed or undirected rectan...
Given a graph and pairs s i t i of terminals, the edge-disjoint paths problem is to determine whethe...
Given a graph and terminal pairs (si, ti), i ∈ [k], the edge-disjoint paths problem is to determine ...
AbstractMany combinatorial problems are NP-complete for general graphs. However, when restricted to ...
International audienceWe prove the NP-completeness of the integer multiflow problem in planar graphs...
AbstractWe show that the l vertex disjoint paths problem between l pairs of vertices can be solved i...
AbstractThe min–min problem of finding a disjoint path pair with the length of the shorter path mini...
AbstractThe H-decomposition problem for a fixed graph H is stated as follows: Can an input graph G b...
AbstractMany combinatorial problems are NP-complete for general graphs. However, when restricted to ...
In 2003, it was claimed that the following problem was solvable in polynomial time: do there exist k...
Consider a network G = (V,E) with distinguished vertices s and t, and with k different costs on ever...
AbstractIt is widely believed that showing a problem to be NP-complete is tantamount to proving its ...
Abstract. Graph packing and partitioning problems have been studied in many contexts, includ-ing fro...
DOI
Add to ORKG