Abstract
In this paper we show that the routing permutation problem is NP-hard even for binary trees. Moreover, we show that in the case of unbounded degree tree networks, the routing permutation problem is NP-hard even if the permutations to be routed are involutions. Finally, we show that the average-case complexity of the routing permutation problem on linear networks is n/4 + o(n). © Springer-Verlag Berlin Heidelberg 2000.
Author supplied keywords
Cite
CITATION STYLE
Barth, D., Corteel, S., Denise, A., Gardy, D., & Valencia-Pabon, M. (2000). On the complexity of routing permutations on trees by arc-disjoint paths. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1776 LNCS, pp. 308–317). https://doi.org/10.1007/10719839_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
