Computing the Diameter of 17-Pancake Graph Using a PC Cluster

@inproceedings{Asai2006ComputingTD,
  title={Computing the Diameter of 17-Pancake Graph Using a PC Cluster},
  author={Shogo Asai and Yuusuke Kounoike and Yuji Shinano and Keiichi Kaneko},
  booktitle={Euro-Par},
  year={2006}
}
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… CONTINUE READING