Node-Disjoint Paths Algorithm in a Transposition Graph

Authors:
Yasuto Suzuki;Keiichi Kaneko;Mario Nakamori
Affiliations:
The author is with the Fujitsu Access Limited, Kawasaki-shi, 213--8586 Japan.,;The authors are with the Faculty of Technology, Tokyo University of Agriculture and Technology, Koganei-shi, 184--8588 Japan. E-mail: k1kaneko@cc.tuat.ac.jp;The authors are with the Faculty of Technology, Tokyo University of Agriculture and Technology, Koganei-shi, 184--8588 Japan. E-mail: k1kaneko@cc.tuat.ac.jp
Venue:
IEICE - Transactions on Information and Systems
Year:
2006

Citing 0
Cited 3

The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs

FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs

Theoretical Computer Science
A routing algorithm of pairwise disjoint paths in a burnt pancake graph

Proceedings of the Second Symposium on Information and Communication Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we give an algorithm for the node-to-set disjoint paths problem in a transposition graph. The algorithm is of polynomial order of n for an n-transposition graph. It is based on recursion and divided into two cases according to the distribution of destination nodes. The maximum length of each path and the time complexity of the algorithm are estimated theoretically to be O(n7) and 3n - 5, respectively, and the average performance is evaluated based on computer experiments.