Learn More

For a given graph G and p pairs (si, ti), 1 < i < p, of vertices in G, the edge-disjoint paths problem is to find p pairwise edge-disjoint paths Pi, 1 _< i < p, connecting s~ and t~. Many combinatorial problems can be efficiently solved for partial k-trees (graphs of treewidth bounded by a fixed integer k), but it has not been-known whether the… (More)

- ‹
- 1
- ›