On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths Extended Abstract
Lecture Notes in Computer Science - Germany
doi 10.1007/10719839_32
Full Text
Open PDFAbstract
Available in full text
Date
January 1, 2000
Authors
Publisher
Springer Berlin Heidelberg