By Topic

Node-to-set disjoint paths in substring reversal graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sinyu Jung ; Graduate School of Engineering, Tokyo University of Agriculture and Technology, Koganei-shi, Tokyo 184-8588 ; Keiichi Kaneko

An n-substring reversal graph Sn is promising as a generic graph because it includes a hypercube, a pancake graph, and a bubble sort graph as its sub graphs. This paper proposes an algorithm N2S that solves the node-to-set disjoint paths problem in substring reversal graphs in polynomial-order time of n. In addition, we prove correctness of the algorithm and estimate the time complexity of the algorithm and the maximum length 6 of paths generated by the algorithm to be O(n6) and 2n-4, respectively.

Published in:

Computer Science and Software Engineering (JCSSE), 2011 Eighth International Joint Conference on

Date of Conference:

11-13 May 2011