Hamiltonian Cycles and Hamiltonian Paths in Faulty Burnt Pancake Graphs(Algorithm Theory)

スポンサーリンク

概要

• 論文の詳細を見る

• Recently, research on parallel processing systems is very active, and many complex topologies have been proposed. A burnt pancake graph is one such topology. In this paper, we prove that a faulty burnt pancake graph with degree n has a fault-free Hamiltonian cycle if the number of the faulty elements is n-2 or less, and it has a fault-free Hamiltonian path between any pair of nonfaulty nodes if the number of the faulty elements is n-3 or less.

• 社団法人電子情報通信学会の論文
• 2007-04-01

著者

• Kaneko Keiichi

  Graduate School Of Engineering Tokyo University Of Agriculture And Technology

関連論文

• Hamiltonian Cycles and Hamiltonian Paths in Faulty Burnt Pancake Graphs(Algorithm Theory)
• The Container Problem in Bubble-Sort Graphs
• An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake Graphs(Dependable Computing)

スポンサーリンク