( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Cluster-Fault-Tolerant Routing in Burnt Pancake Graphs.

, , , и . ICA3PP (2), том 6082 из Lecture Notes in Computer Science, стр. 264-274. Springer, (2010)

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.

Keiichi Kato

Tanja Kaneko

Gaël Kaneko

Kiosuke Kaneko

Keiichi Onodera

 

Другие публикации лиц с тем же именем

Node-disjoint Paths in a Transposition Graph., , и . PDPTA, стр. 298-304. CSREA Press, (2004)Hamiltonian Paths and Cycles in Faulty Burnt Pancake Graphs.. PDPTA, стр. 253-259. CSREA Press, (2006)Node-to-Set Disjoint Paths Problem in Burnt Pancake Graphs.. SNPD, стр. 285-292. ACIS, (2003)The Set-to-Set Disjoint-Path Problem in Perfect Hierarchical Hypercubes., и . Comput. J., 55 (6): 769-775 (2012)Set-to-set disjoint-path routing in perfect hierarchical hypercubes., и . C3S2E, стр. 51-57. ACM, (2011)Container Problem in Burnt Pancake Graphs., , и . ISPA, том 3758 из Lecture Notes in Computer Science, стр. 479-490. Springer, (2005)Learners' Self Checking and Its Effectiveness in Conceptual Data Modeling Exercises., , , , , и . IEICE Trans. Inf. Syst., 101-D (7): 1801-1810 (2018)Elicitation of Appropriate Scratching Zones Based on Lecture Slide Layouts., , , , , и . HCI (22), том 11587 из Lecture Notes in Computer Science, стр. 430-441. Springer, (2019)Node-to-Set Disjoint Paths Problem in Rotator Graphs., и . ASIAN, том 1961 из Lecture Notes in Computer Science, стр. 119-132. Springer, (2000)Fault-Tolerant Routing Based on Approximate Directed Routable Probabilities for Hypercubes., и . ICA3PP (1), том 7016 из Lecture Notes in Computer Science, стр. 106-116. Springer, (2011)