金-1 グラフやネットワークに関する研究
超並列計算機を構成するための相互結合網として有望な一連の位相を提供するケイリー
グラフを中心として,その経路選択アルゴリズムや新しい位相の開発を目指す.
有名なケイリーグラフには,ハイパーキューブ,パンケーキグラフ,焦げたパンケーキグラフ,ローテータグラフ,
スターグラフ,トランスポジショングラフ,バブルソートグラフ,サブストリングリバーサル
グラフなどがあり,これらを題材に研究を進める.研究の内容は,以下の通り.
- 直径計算
n-パンケーキグラフやn-焦げたパンケーキグラフでは,その正確な直径は,
nの関数として求められておらず,その代わりに,いくつかの上界,下界,予測などが,
存在する.卒論では,18-パンケーキグラフあるいは13-焦げたパンケーキグラフの直径を
計算して,上界,下界,予測などの優劣を論じる.
- 耐故障経路選択問題
連結度kのグラフでは,k-1個の故障要素(ノード,エッジ)が存在しても,
非故障ノード間に非故障経路を選択することができる.いくつかのグラフに対して,
条件を設定して,この問題の解決を目指す.また,グラフによっては,故障クラスタを
1つの故障ノードとみなして,処理できる場合があり,大幅に耐故障性を向上可能である.
このようなグラフにおける経路選択算法を開発する.
- 素な経路問題
連結度kのグラフでは,任意の2ノード間にk本の内素な経路(コンテナ)を選択する
ことができる.また,1つのノードからk個のノードへ半素な経路を選択することもできる.
あるいは,k個の出発ノードから,k個の目的ノードへの素な経路も選択可能で
ある.さらに,Ln/2」個のノード対間の素な経路も選択することができる.
いくつかのグラフに対して,このような問題の解決を目指す.
- 位相の設計と性能評価
今までに提案されていない位相を考え,その性質の良さを示す.性質には,ノード数,次数,
連結度,直径,平均距離,正則性,対称性,ハミルトン閉路性,ハミルトン連結性,経路
選択の容易さ,などがある.
以上

なんでパンケーキグラフっていうのか知りたい人は,金子研へ.ちなみに
上の図は,20-パンケーキグラフの1つのノードを表しています(←ホントか?).
金-1 最近の研究成果
- Wang, Yitong, Htoo Htoo Sandi Kyaw, Kunihiro Fujiyoshi, and Keiichi Kaneko:
"Fault-tolerant Routing in Bicubes," IEICE Transactions on Information and
Systems, Vol. E108-D, No. 1, 2025. (修士研究)
- Kaneko, Arata, Htoo Htoo Sandi Kyaw, Kunihiro Fujiyoshi, and Keiichi
Kaneko: "Node-to-node and Node-to-set Disjoint Paths Problems in Bicubes,"
IEICE Transactions on Information and Systems, Vol. 107-D, No. 9, pp. 1133--1139,
Sept. 2024. (修士研究)
- Ichida, Hiroyuki, and Keiichi Kaneko: "Set-to-set Disjoint Paths in a
Folded Hypercube," Theoretical Computer Science, Vol. 1000, Paper ID: 114562,
June 2024. (博士研究)
- Sasaki, Rikuya, Hiroyuki Ichida, Htoo Htoo Sandi Kyaw, and Keiichi Kaneko:
"Node-to-set Disjoint Paths Problem in Cross-cubes," IEICE Transactions on
Information and Systems, Vol. E107-D, Jan. 2024. (卒業研究)
- Jung, Sinyu, and Keiichi Kaneko: "Feedback Node Sets in Pancake Graphs and
Burnt Pancake Graphs," IEICE Transactions on Information and Systems, Vol.
E106-D, No. 10, pp. 1677--1685, Oct. 2023. (博士研究)
- Wang, Yitong, Htoo Htoo Sandi Kyaw, and Keiichi Kaneko: "Fault-tolerant
Routing Methods in Bicubes," Proceedings of 2023 International Conference on
Parallel and Distributed Processing Techniques and Applications, Las Vegas,
Nevada, USA, July 24--27, 2023. (修士研究)
 |
ビシッと発表しています |
- Bossard, Antoine, Keiichi Kaneko, and Frederick C. Harris, Jr.: "On the
Crossing Number of a Torus Network," IEICE Transactions on Fundamentals of
Electronics, Communications and Computer Sciences, Vol. E106-A, No. 1,
Jan. 2023.
- Ichida, Hiroyuki and Keiichi Kaneko: "Set-to-Set Disjoint Paths Problem in
Möbius Cubes," IEEE Access, Vol. 10, 2022. (博士研究)
- Okada, Masaaki and Keiichi Kaneko: "Minimal Paths in a Bicube," IEICE
Transactions on Information and Systems, Vol. E105-D, No. 8, pp. 1383--1392,
Aug. 2022. (修士研究)
- Kaneko, Keiichi, Antoine Bossard, and Frederick C. Harris, Jr.: "Set-to-set
Disjoint Path Routing in Bijective Connection Graphs," IEEE Access, Vol. 10,
pp. 72731--72742, 2022.
- Ichida, Hiroyuki, and Keiichi Kaneko: "Set-to-Set Disjoint Paths in a
Folded Hypercube," Proceedings of 2021 International Conference on Parallel
and Distributed Processing Techniques and Applications, Las Vegas, Nevada,
USA, July 26--29, 2021. (博士研究)
- Okada, Masaaki, and Keiichi Kaneko: "A Shortest-path Routing Algorithm in
Bicubes," Advances in Parallel & Distributed Processing, and Applications,
pp. 535--549, Las Vegas, Nevada, USA, July 27--30, 2020. (修士研究)
- Kaneko, Keiichi, Son Van Nguyen, and Huynh Thi Thanh Binh: "Pairwise
Disjoint Paths Routing in Tori," IEEE Access, pp. 192206--192217, Oct.
2020. (短期留学による研究)
- Kaneko, Keiichi: "Node-disjoint Paths Problems in Directed Bijective
Connection Graphs," IEICE Transactions on Information and Systems, Vol.
E103-D, No. 1, pp. 93--100, Jan. 2020.
- Seki, Nobuhiro, Kousuke Mouri, and Keiichi Kaneko: "Fault-tolerant Routing
based on Fault Information of Cross-edges in Dual-cubes," Proceedings of 2019
International Conference on Parallel and Distributed Processing Techniques and
Applications, pp. 47--53, Las Vegas, Nevada, USA, July 29--Aug. 1, 2019.
(修士研究)
- Bossard, Antoine, and Keiichi Kaneko: "Refining the Unrestricted Character
Encoding for Japanese," Proceedings of the ISCA 33rd International Conference
on Computers and Their Applications, Honolulu, Hawaii, USA, Mar. 18--20, 2019.
- Otake, Koji, Kousuke Mouri, and Keiichi Kaneko: "Fault-tolerant Routing
Methods in Crossed Cubes,” Proceedings of the 10th International Conference
on Advances in Information Technology, Bangkok, Thailand, Dec. 10--13, 2018.
(修士研究)
- Nagashima, Hiroki, Mouri Kousuke, and Keiichi Kaneko: "Node-to-node Disjoint
Paths in Twisted Crossed Cubes," Proceedings of the 10th International Conference
on Advances in Information Technology, Bangkok, Thailand, Dec. 10--13, 2018.
(修士研究)
 |  |  |  |
発表当日朝の沈痛な面持ち | 発表します | 続いて発表します | 発表終了後の爽やかな表情 |
- Bossard, Antoine, and Keiichi Kaneko: "Torus Pairwise Disjoint-path Routing,"
Sensors, Vol. 18, No. 12, PaperID 3912(16p), Dec. 2018.
- Nishiyama, Yo, Yuko Sasaki, Yuki Hirai, Hironori Nakajo, and Keiichi
Kaneko: "Fault-tolerant Routing based on Routing Capabilities in a
Hyper-Star Graph," Journal of Information Science and Engineering, Vol. 34,
No. 6, pp. 1353-1366, Nov. 2018. (修士研究)
- Bossard, Antoine, Keiichi Kaneko and Frederick C. Harris Jr.: "On the
Crossing Number of Tori," Proceedings of the Fourth International Conference
on Electronics and Software Science, Takamatsu, Kagawa, Japan, Nov. 5--7, 2018.
- Thuan, Bui Thi, Lam Boi Ngoc, and Keiichi Kaneko: "A Stochastic
Link-fault-tolerant Routing Algorithm in Folded Hypercubes," The Journal of
Supercomputing, Vol. 74, No. 10, pp. 5539--5557, Oct. 2018.
(修士研究)
- Bossard, Antoine, and Keiichi Kaneko: "On the Torus Pairwise Disjoint-path
Routing Problem," Proceedings of the 18th IEEE International Conference on
Computer and Information Technology, pp. 1739--1746, Halifax, NS, Canada,
July 30--Aug. 3, 2018.
- Satoh, Kaito, Kousuke Mouri, and Keiichi Kaneko: "A Fully Adaptive Minimal
Routing Algorithm in a Crossed Cube," Proceedings of 2018 International Conference
on Parallel and Distributed Processing Techniques and Applications, pp. 183--189,
Las Vegas, Nevada, USA, July 30--Aug. 2, 2018.
(修士研究)
- Kuramochi, Seiya, Yu-on Chatchakan, Kousuke Mouri, and Keiichi Kaneko:
"Stochastic Link-fault-tolerant Routing in a Torus," Proceedings of the 15th
International Joint Conference on Computer Science and Software Engineering,
pp. 1--6, Nakhon Pathom, Thailand, July 11--13, 2018.
(先進情報工学実験I)
 |
発表終わってリラックス |
- Bossard, Antoine, and Keiichi Kaneko: "Proposal of an Unrestricted Character
Encoding for Japanese," Proceedings of the 13th International Baltic Conference
on Databases and Information Systems, Trakai, Lithuania, July 1--4,
2018.
- Kaneko, Keiichi, and Antoine Bossard: "A Set-to-Set Disjoint Paths Routing
Algorithm in Tori," International Journal of Networking and Computing,
Vol. 7, No. 2, pp. 173--186, July 2017.
- Kocík, David, and Keiichi Kaneko: "Node-to-Node Disjoint Paths Problem
in a Möbius Cube," IEICE Transactions on Information and Systems, Vol. E100-D,
No. 8, pp. 1837--1843, Aug. 2017. (短期留学による研究)
- Park, Junsuk, Nobuhiro Seki, and Keiichi Kaneko: "Stochastic Fault-tolerant
Routing in Dual-Cubes," IEICE Transactions on Information and Systems, Vol. E100-D,
No. 8, pp. 1920--1921, Aug. 2017. (修士研究)
- Kaneko, Keiichi, and Antoine Bossard: "Set-to-Set Disjoint Paths in Tori,"
Proceedings of the 4th International Symposium on Computing and Networking,
Hiroshima, Japan, Nov. 22--25, 2016.
- Bossard, Antoine, and Keiichi Kaneko: "A Scientific Approach to Chinese Characters:
Rationale, Ontology and Application," Proceedings of the 29th International Conference
on Computers Applications in Industry and Engineering, Marriott Tech Center, Denver,
USA, Sept. 26--28, 2016. International Society for Computers and Their Applications
- Tokuda, Masato, Yuki Hirai, and Keiichi Kaneko: "An Algorithm for k-pairwise
Cluster-Fault-Tolerant Disjoint Paths in a Burnt Pancake Graph," Proceedings of
2016 International Conference on Parallel and Distributed Processing Techniques
and Applications, pp. 43--49, Las Vegas, Nevada, USA, July 25--29, 2016. (修士研究)
- Takano, Yudai, Yuki Hirai, and Keiichi Kaneko: "Fault-tolerant Routing in a Locally
Twisted Cube," Proceedings of the 2016 Fifth ICT International Student Project
Conference, ISPC2016_23, Nakhon Pathom, Thailand, May 27--28, 2016. (卒業研究)
- Bossard, Antoine, and Keiichi Kaneko: "A Set-to-Set Disjoint Paths Routing
Algorithm in a Torus-Connected Cycles Network," Proceedings of the 31st ISCA
International Conference on Computers and Their Applications, pp. 81--88, Las Vegas,
Nevada, USA, Apr. 4--6, 2016.
- Bossard, Antoine, and Keiichi Kaneko: "Set-to-Set Disjoint Paths
Routing in Torus-Connected Cycles," IEICE Transactions on Information
and Systems, Vol. E99-D, No. 11, pp. 2821--2823, Nov. 2016.
- Lam Boi Ngoc, Bui Thi Thuan, Yuki Hirai, and Keiichi Kaneko: "Stochastic
Link-Fault-Tolerant Routing in Hypercubes," Journal of Advances in Computer
Networks, Vol. 4, No. 2, pp. 100--106, June 2016. (短期留学による研究)
- David Kocík, Yuki Hirai, and Keiichi Kaneko: "Node-to-Set Disjoint
Paths Problem in a Möbius Cube," IEICE Transactions on Information
and Systems, Vol. E99-D, No. 3, Mar. 2016. (短期留学による研究)
- Bossard, Antoine, and Keiichi Kaneko: "Torus-Connected Cycles:
A Simple and Scalable Topology for Interconnection Networks,"
International Journal of Applied Mathematics and Computer Science,
Vol. 25, No. 4, Dec. 2015.
- Bossard, Antoine, and Keiichi Kaneko: "A Routing Algorithm Solving
the Container Problem in a Hypercube with Bit Constraint," International
Journal of Networked and Distributed Computing, Vol. 3, No. 4, pp. 202--213,
Nov. 2015.
- Bossard, Antoine, Keiichi Kaneko, and Shietung Peng: "Node-to-Set
Disjoint Paths Routing in a Metacube," International Journal of High
Performance Computing and Networking, Vol. 8, No. 4, pp. 315--323, Nov. 2015.
- Park, Junsuk, Yuki Hirai, and Keiichi Kaneko: "Fault-tolerant Routing in Dual-cubes
based on Routing Probabilities," Proceedings of the 7th International Conference
on Advances in Information Technology, Bangkok, Thailand, Nov. 2015. (修士研究)
- Bossard, Antoine, and Keiichi Kaneko: "Hypercube Fault Tolerant Routing with Bit
Constraint," International Journal of Networking and Computing, Vol. 5, No. 2, pp. 272--289, July 2015.
- Kocík, David, Yuki Hirai and Keiichi Kaneko: "An Algorithm for Node-to-Node Disjoint
Paths Problem in a Möbius Cube," Proceedings of the 2015 International Conference on
Parallel and Distributed Processing Techniques and Applications, pp. 149--155, Las Vegas,
Nevada, USA, July 27--30, 2015. (短期留学による研究)
- Bossard, Antoine, and Keiichi Kaneko: "On Solving the Container Problem in a
Hypercube with Bit Constraint," Proceedings of the 16th IEEE/ACIS International
Conference on Software Engineering, Artificial Intelligence, Networking and
Parallel/Distributed Computing, pp. 77--92, Takamatsu, Kagawa, Japan, June 1--3, 2015.
- Kocík, David, Yuki Hirai and Keiichi Kaneko: "An Algorithm for Node-to-Set Disjoint
Paths Problem in a Möbius Cube," Proceedings of the 2015 4th International Student
Project Conference, Tokyo, Japan, May 23--24, 2015. (短期留学による研究)
- Wakayama, Keita, Yuki Hirai and Keiichi Kaneko: "A Fault-tolerant Routing Algorithm
based on Safety Levels in a Burnt Pancake Graph," Proceedings of the 2015 4th
International Student Project Conference, Tokyo, Japan, May 23--24, 2015. (卒業研究)
- Lam Boi Ngoc, Bui Thi Thuan, Yuki Hirai, and Keiichi Kaneko: "Stochastic
Link-Fault-Tolerant Routing in Hypercubes," Proceedings of the 2015 7th International
Conference on Computer Research and Development, pp. 21--27, Ho Chi Minh City,
Vietnam, Feb. 6--7, 2015. (短期留学による研究)
 |
学会のランチです |
- Bossard, Antoine, and Keiichi Kaneko: "A Node-to-Set Disjoint Paths
Routing Algorithm in Torus-Connected Cycles," ISCA International
Journal of Computers and their Applications, Vol. 22, No. 1, pp. 22--30,
Jan. 2015.
- Bossard, Antoine, and Keiichi Kaneko: "On Hypercube Routing and Fault Tolerance
with Bit Constraint," Proceedings of the Second International Symposium on Computing
and Networking," pp. 40--49, Shizuoka, Japan, Dec. 10--12, 2014. (Best Paper Award)
- Nishiyama, Yo, Yuki Hirai, and Keiichi Kaneko: "Fault-Tolerant Routing based
on Improved Safety Levels in Pancake Graphs," Proceedings of the 15th International
Conference on Parallel and Distributed Computing, Applications and Technologies,
pp. 113--118, Hong Kong, China, Dec. 9--11, 2014. (修士研究)
- Ito, Takara, Manabu Myojin, Yuki Hirai, and Keiichi Kaneko: "Fault-tolerant
Routing in (n; k)-Star Graphs," Proceedings of the 15th International Conference
on Parallel and Distributed Computing, Applications and Technologies, Hong Kong,
China, pp. 76--81, Dec. 9--11, 2014. (修士研究)
- Bui Thi Thuan, Yuki Hirai, Huynh Thi Thanh Binh, and Keiichi Kaneko:
"Stochastic Link-fault-tolerant Routing in a Hyper-star graph," Proceedings of
the IADIS International Conference on Applied Computing 2014, pp. 45--52,
Porto, Portugal, Oct. 25--27, 2014. (修士研究)
- Yuko, Sasaki, Yuki Hirai, Hironori Nakajo, and Keiichi Kaneko: "A Fault-tolerant
Routing Algorithm based on Safety Levels in a Hyper-Star Graph," Proceedings of
the 2014 International Conference on Parallel and Distributed Processing Techniques
and Applications, Vol. 2, pp. 77--83, Las Vegas, Nevada, USA, July 21--24, 2014. (修士研究)
 |
真剣に発表します |
- Dinh, Thuy Duong, and Keiichi Kaneko: "Fault-tolerant Routing based on
Approximate Directed Routable Probabilities for Hypercubes," Future
Generation Computer Systems, Vol. 37, pp. 88--96, July 2014. (修士研究)
- Bossard, Antoine, and Keiichi Kaneko: "Set-to-set Disjoint Paths Routing
in Hyper-star Graphs," Proceedings of ISCA 3rd International Conference on
Advanced Computing and Communications, pp. 47--52, Los Angeles, California, USA,
Sept. 25--27, 2013. (Best Paper Award)
- Nishiyama, Yo, Yuki Hirai, and Keiichi Kaneko: "A Stochastic Fault-tolerant
Routing Algorithm in Hyper-Star Graphs," Proceedings of the 2013 International
Conference on Parallel and Distributed Processing Techniques and Applications,
Vol. 2, pp. 382--388, Las Vegas, Nevada, USA, July 22--25, 2013. (卒業研究)
- Bossard, Antoine, and Keiichi Kaneko: "Node-to-Set Disjoint-path Routing
in Hierarchical Cubic Networks," The Computer Journal, Vol. 55, No. 12,
pp. 1440--1446, 2012. (博士研究)
- Nishiyama, Yo, Yuki Hirai, and Keiichi Kaneko: "Fault-tolerant Routing
Based on Directed Safety Levels in a Hyper-Star Graph," Proceedings of
the International Conference on Advanced Computer Science, Applications
and Technologies, CD-ROM, Kuala Lumpur, Malaysia, Nov. 26--28, 2012. (卒業研究)
 |
ホーチミン市で乗り継ぎ |
- Nishiyama, Yo, Yuki Hirai, and Keiichi Kaneko: "Fault-tolerant Routing
Based on Safety Levels in a Hyper-star Graph," Proceedings of the IADIS
International Conference on Applied Computing 2012, pp. 348--352, Madrid,
Spain, Oct. 19--21, 2012. (卒業研究)
- Myojin, Manabu, and Keiichi Kaneko: "A Fault-tolerant Routing Algorithm
using Directed Probabilities in Hypercube Networks," Proceedings of the 2012
International Conference on Parallel and Distributed Processing Techniques
and Applications, Vol. 1, pp. 131--136, Las Vegas, Nevada, USA, July 16--19,
2012. (卒業研究)
 |
ビジネスクラスにアップグレード |
- Bossard, Antoine, and Keiichi Kaneko: "The Set-to-Set Disjoint-path Problem
in Perfect Hierarchical Hypercubes," The Computer Journal, Vol. 55, No. 6,
pp. 1440--1446, June 2012. (博士研究)
- 金子敬一: "部分列反転グラフにおける内素な経路," 電子情報通信学会論文誌,
Vol. J95-D, No. 1, pp. 43--57, Jan. 2012.
- Dinh Thuy Duong and Keiichi Kaneko: "Fault-tolerant Routing Algorithms
based on Approximate Directed Routable Probabilities for Hypercubes,"
Proceedings of the 11th International Conference on Algorithms and Architectures
for Parallel Processing, pp. 106--116, Melbourne, Australia, Oct. 24--26,
2011. (LNCS 7016 Algorithm and Architectures for Parallel Processing, Part 1) (修士研究)
- Iwasaki, Tatsuya, and Keiichi Kaneko: "A Routing Algorithm of Pairwise
Disjoint Paths in a Burnt Pancake Graph," Proceedings of the 2nd International
Symposium on Information and Communication Technology, pp. 62--66, Hanoi,
Vietnam, Oct. 13--14, 2011. (博士研究)
- Bossard, Antoine, Keiichi Kaneko, and Shietung Peng: "A New Node-to-Set
Disjoint-path Algorithm in Perfect Hierarchical Hypercubes," The Computer
Journal, Vol. 54, No. 8, pp. 1372--1381, Aug. 2011. (博士研究)
- Dinh Thuy Duong and Keiichi Kaneko: "Fault-tolerant Routing Algorithms
based on Approximate Routable Probabilities for Hypercube Networks,"
Proceedings of the 2011 International Conference on Parallel and Distributed
Processing Techniques and Applications, Vol. 1, pp. 116--122, Las Vegas,
Nevada, USA, July 18--21, 2011. (修士研究)
 |
ペロッと平らげました |
- Bossard, Antoine, Keiichi Kaneko, and Shietung Peng: "Node-to-set
Disjoint-path Routing in Perfect Hierarchical Hypercubes," Proceedings of
the International Conference on Computational Science, pp. 442--451, Singapore,
June 1--3, 2011. (博士研究)
- Bossard, Antoine, Keiichi Kaneko, and Shietung Peng: "Set-to-set
Disjoint-path Routing in Perfect Hierarchical Hypercubes," Proceedings
of the Fourth International C* Conference on Computer Science & Software
Engineering, pp. 51--57, Montreal, Quebec, Canada, May 16--18, 2011. (博士研究)
- Jung, Sinyu, and Keiichi Kaneko: "An Algorithm for Node-to-Set Disjoint
Paths Problem in a Substring Reversal Graph," Proceedings of the 8th Joint
Conference on Computer Science and Software Engineering, pp. 242--246, Nakhon
Pathom, Thailand, May 11--13, 2011. (博士研究)
- Iwasawa, Nagateru, Antoine Bossard, and Keiichi Kaneko: "Set-to-Set Disjoint Path Routing Algorithm
in Burnt Pancake Graphs," Proceedings of the ISCA 26th International Conference on Computers and
their Applications, New Orleans, Louisiana, USA, Mar. 23--25, 2011. (修士研究)
- Bossard, Antoine, Keiichi Kaneko, and Shietung Peng: "Node-to-Set Disjoint Paths Routing
in Metacube," Proceedings of the IASTED International Conference on Parallel and Distributed
Computing and Sysetms, pp. 289--296, Marina del Rey, CA, USA, Nov. 8--10, 2010. (博士研究)
- Bossard, Antoine, Keiichi Kaneko, and Shietung Peng: "A Node-to-Set Disjoint-path Routing
Algorithm in Perfect Hierarchical Hypercubes," Proceedings of the First International Conference
on Advanced Computing and Communications, pp. 6-10, Orlando, Florida, USA, Sept. 15--17, 2010.
(博士研究)
- Jung, Sinyu, and Keiichi Kaneko: "A Feedback Vertex Set on Pancake Graphs," Proceedings
of the 2010 International Conference on Parallel and Distributed Processing Techniques and
Applications, Vol. 2, pp. 532--537, Las Vegas, Nevada, USA, July 12--15, 2010. (卒業研究)
 |  |  |
牛乳飲んで(成田) | ジュース飲んで(ロス) | 食事を楽しみます(ベガス) |
- Iwasaki, Tatsuya, and Keiichi Kaneko: "Fault-tolerant Routing in Burnt
Pancake Graphs," Information Processing Letters, Vol. 110, No. 14-15,
pp. 535--538, July 2010. (修士研究)
- Iwasawa, Nagateru, Tatsuro Watanabe, Tatsuya Iwasaki, Keiichi Kaneko: "Cluster-fault-tolerant
Routing in Burnt Pancake Graphs," Proceedings of the 2010 International Symposium on
Frontiers of Parallel and Distributed Computing, pp. 264--274, Busan, Korea, May 21--23,
2010. (修士研究)
- Bossard, Antoine, Keiichi Kaneko, and Shietung Peng: "Fault-tolerant Node-to-set
Disjoint-path Routing in Hypercubes," Proceedings of the 10th International Conference
on Algorithms and Architectures for Parallel Processing, pp. 511--519, Busan, Korea,
May 21--23, 2010. (博士研究)
- Bossard, Antoine, Keiichi Kaneko, and Shietung Peng: "Node-to-Set Disjoint Paths
Problem in Perfect Hierarchical Hypercubes," Proceedings of the Ninth IASTED
International Conference on Parallel and Distributed Computing and Networks, pp.
65--72, Innsbruck, Austria, Feb. 16--18, 2010. (博士研究)
- Bossard, Antoine, Keiichi Kaneko, and Shietung Peng: "A Node-to-set Disjoint-path
Routing Algorithm in Metacube," Proceedings of the 10th International Symposium on
Pervasive Systems, Algorithms and Networks, pp. 23--28, Kao-Hsiung, Taiwan, Dec.
14--16, 2009. (博士研究)
- Bossard, Antoine, Keiichi Kaneko, and Shietung Peng: "Node-to-set Disjoint-path
Routing in Metacube," Proceedings of the Tenth International Conference on Parallel
and Distributed Computing, Applications and Technologies, pp. 57--62, Hiroshima,
Japan, Dec. 8--9, 2009. (博士研究)
 |
ニッポン最高! |
- Iwasaki, Tatsuya, and Keiichi Kaneko: "A Fault-tolerant Routing Algorithm of
Burnt Pancake Graphs," Proceedings of the 2009 International Conference on
Parallel and Distributed Processing Techniques and Applications, Vol. 1, pp.
307--313, Las Vegas, Nevada, USA, July 13--16, 2009. (修士研究)
- Iwasaki, Tatsuya, and Keiichi Kaneko: "A New Configuration of an Incomplete
Star Graph and its Routing Algorithm," Proceedings of the 2008 International
Conference on Parallel and Distributed Processing Techniques and Applications,
pp. 116--122, Las Vegas, Nevada, USA, July 14--17, 2008. (卒業研究)
- Suzuki, Yasuto, and Keiichi Kaneko: "The Container Problem in Bubble-Sort
Graphs," IEICE Transactions on Information and Systems,
Vol. E91-D, No. 4, pp. 1003--1009, Apr. 2008. (博士研究)
- Sawada, Naoki, Keiichi Kaneko, and Shietung Peng: "Pairwise Disjoint
Paths in Pancake Graphs," Proceedings of the Eighth International
Conference on Parallel and Distributed Computing, Applications and
Technologies, pp. 376--382, Adelaide, Australia, Dec. 3--6, 2007. (修士研究)
 |
海岸で一人物思いにふけるのも良いものです |
- Watanabe, Tatsuro, Keiichi Kaneko, Shietung Peng: "Node-to-Set
Cluster-Fault-Tolerant Disjoint Routing in Pancake Graphs,"
Proceedings of the ISCA 20th International Conference on Parallel and
Distributed Computing Systems, pp. 200--205, Las Vegas, USA, Sept. 24--26,
2007. (卒業研究)
- 澤田直樹, 金子敬一: "(n, k)-パンケーキグラフとその特性," 電子情報通信学会論文誌,
Vol. J91-D, No. 1, pp. 1--11, Jan. 2008. (修士研究)
- Sawada, Naoki, and Keiichi Kaneko: "An $(n,k)$-Pancake Graph and its
Properties," Proceedings of the 2007 International Conference
on Parallel and Distributed Processing Techniques and Applications, pp.
173--179, June 25--28, Las Vegas, USA, 2007. (修士研究)
 |  |
成田(行き) | ロス(帰り)…成長したの? |
- Kaneko, Keiichi, and Naoki Sawada: "An Algorithm for Node-to-Node
Disjoint Paths Problem in Burnt Pancake Graphs," IEICE Transactions on
Information and Systems, Vol. E90-D, No. 1, pp. 306--313, Jan. 2007. (卒業研究)
- Suzuki, Yasuto, Keiichi Kaneko and Mario Nakamori: "Node-Disjoint Paths
in a Transposition Graph," IEICE Transactions on Information and Systems,
Vol. E89-D, No. 10, pp. 2600--2605, Oct. 2006. (博士研究)
- Suzuki, Yasuto, and Keiichi Kaneko: "An Algorithm for Disjoint Paths in
Bubble-sort Graphs," Systems and Computers in Japan, Vol. 37, No. 12,
pp. 27--32, Sept. 2006. (修士研究)