Learn More
For a given graph G and p pairs (s i ,t i ) , $1\leq i\leq p$ , of vertices in G , the edge-disjoint paths problem is to find p pairwise edge-disjoint paths P i , $1\leq i\leq p$ , connecting s i and t i . Many combinatorial problems can be efficiently solved for partial k -trees (graphs of treewidth bounded by a fixed integer k ), but the edge-disjoint(More)
  • 1