Xiao Zhou;Syurei Tamura;Takao Nishizeki
-;-;-
The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation