Title :
Container problem in substring reversal graphs
Author :
Suzuki, Yasuto ; Kaneko, Keiichi ; Nakamori, Mario
Author_Institution :
Dept. of Comput., Inf. & Commun. Sci., Tokyo Univ. of Agric. & Technol., Japan
Abstract :
In this paper, we propose an algorithm that solves the container problem in n-substring reversal graphs in polynomial order time of n. Its correctness is proved and estimates of time complexity and sum of path lengths are given. We also report the results of computer experiment conducted to measure the average performance of our algorithm.
Keywords :
computational complexity; graph theory; multiprocessor interconnection networks; network topology; program verification; algorithm correctness proving; container problem; path lengths; substring reversal graphs; time complexity; Concurrent computing; Containers; Distributed computing; Fault diagnosis; Hypercubes; Network topology; Parallel architectures; Parallel machines; Polynomials; Routing;
Conference_Titel :
Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on
Print_ISBN :
0-7695-2135-5
DOI :
10.1109/ISPAN.2004.1300538
