A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Computing the Diameter of 17-Pancake Graph Using a PC Cluster
[chapter]
2006
Lecture Notes in Computer Science
An n-pancake graph is a graph whose vertices are the permutations of n symbols and each pair of vertices are connected with an edge if and only if the corresponding permutations can be transitive by a prefix reversal. Since the n-pancake graph has n! vertices, it is known to be a hard problem to compute its diameter by using an algorithm with the polynomial order of the number of vertices. Fundamental approaches of the diameter computation have been proposed. However, the computation of the
doi:10.1007/11823285_117
fatcat:gdhgbkqxlzf7hpntfdamshh7r4