( en | de | ru )

 

Disambiguation of "Kaneko, Keiichi"

Author of the publication

copydeleteadd this publication to your clipboard
Set-to-set disjoint-path routing in perfect hierarchical hypercubes.

, and . C3S2E, page 51-57. ACM, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Tanja Kaneko

Keiichi Kato

Gaël Kaneko

Kiosuke Kaneko

Keiichi Omoto

 

Other publications of authors with the same name

A routing algorithm of pairwise disjoint paths in a burnt pancake graph., and . SoICT, page 62-66. ACM, (2011)Cluster-Fault-Tolerant Routing in Burnt Pancake Graphs., , , and . ICA3PP (2), volume 6082 of Lecture Notes in Computer Science, page 264-274. Springer, (2010)Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes., , and . ICA3PP (1), volume 6081 of Lecture Notes in Computer Science, page 511-519. Springer, (2010)Torus-Connected Cycles: An Implementation-Friendly Topology for Interconnection Networks of Massively Parallel Systems., and . ICA3PP (2), volume 8286 of Lecture Notes in Computer Science, page 11-21. Springer, (2013)Time Optimal Node-to-Set Disjoint Paths Routing in Hypercubes., and . J. Inf. Sci. Eng., 30 (4): 1087-1093 (2014)Application of a Visual Computer Simulator into Collaborative Learning., , and . J. Comput. Inf. Technol., 14 (4): 267-273 (2006)Educational data mining for discovering hidden browsing patterns using non-negative matrix factorization., , , , , , and . Interact. Learn. Environ., 29 (7): 1176-1188 (2021)A Set-to-Set Disjoint Paths Routing Algorithm in Tori., and . Int. J. Netw. Comput., 7 (2): 173-186 (2017)An Algorithm for Node-to-Set Disjoint Paths Problem in Bi-Rotator Graphs.. IEICE Trans. Inf. Syst., 89-D (2): 647-653 (2006)k-pairwise disjoint paths routing in perfect hierarchical hypercubes., and . J. Supercomput., 67 (2): 485-495 (2014)