A Fault-tolerant Routing Algorithm of Burnt Pancake Graphs - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Tatsuya Iwasaki, Keiichi Kaneko. A Fault-tolerant Routing Algorithm of Burnt Pancake Graphs. In Hamid R. Arabnia, editor, Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2009, Las Vegas, Nevada, USA, July 13-17, 2009, 2 Volumes. pages 307-313, CSREA Press, 2009.

The following publications are possibly variants of this publication:

Fault-tolerant routing in burnt pancake graphsTatsuya Iwasaki, Keiichi Kaneko. ipl, 110(14-15):535-538, 2010. [doi]

Cluster-Fault-Tolerant Routing in Burnt Pancake GraphsNagateru Iwasawa, Tatsuro Watanabe, Tatsuya Iwasaki, Keiichi Kaneko. ica3pp 2010: 264-274 [doi]

A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphsTatsuro Watanabe, Keiichi Kaneko, Shietung Peng. ISCApdcs 2007: 200-205

A routing algorithm of pairwise disjoint paths in a burnt pancake graphTatsuya Iwasaki, Keiichi Kaneko. soict 2011: 62-66 [doi]

Set-to-Set Disjoint Path Routing Algorithm in Burnt Pancake GraphsNagateru Iwasawa, Antoine Bossard, Keiichi Kaneko. cata 2011: 21-26

An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake GraphsKeiichi Kaneko, Naoki Sawada. ieicet, 90-D(1):306-313, 2007. [doi]

Container Problem in Burnt Pancake GraphsNaoki Sawada, Yasuto Suzuki, Keiichi Kaneko. ispa 2005: 479-490 [doi]

runs on WebDSL