PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Kawaguchi, Kimio"

Author of the publication

copydeleteadd this publication to your clipboard
Fault-tolerant network routings for (k + 1)-node connected and (k + 1)-edge connected graphs.

, , and . Systems and Computers in Japan, 18 (11): 50-60 (1987)

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.

No persons found for author name Kawaguchi, Kimio
add a person with the name Kawaguchi, Kimio
 

Other publications of authors with the same name

Parallel Algorithms for Partitioning Sorted Sets and Related Problems., , , and . ESA, volume 1136 of Lecture Notes in Computer Science, page 234-245. Springer, (1996)Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs., and . WG, volume 790 of Lecture Notes in Computer Science, page 132-143. Springer, (1993)Fault-tolerant network routings for (k + 1)-node connected and (k + 1)-edge connected graphs., , and . Systems and Computers in Japan, 18 (11): 50-60 (1987)Parallel Algorithms for Partitioning Sorted Sets and Related Problems., , , and . Algorithmica, 28 (2): 217-241 (2000)Constructing a Strongly Convex Superhull of Points., , , and . COCOON, volume 1276 of Lecture Notes in Computer Science, page 42-51. Springer, (1997)Parallel Robust Algorithms for Constructing Strongly Convex Hulls., , and . Symposium on Computational Geometry, page 133-140. ACM, (1996)Efficient Algorithms for a Mixed k-Partition Problem of Graphs Without Specifying Bases., , and . Theor. Comput. Sci., 201 (1-2): 233-248 (1998)Highly Fault-Tolerant Routings and Diameter Vulnerability for Generalized Hypercube Graphs., , , and . WG, volume 1017 of Lecture Notes in Computer Science, page 197-208. Springer, (1995)Optimal Fault-Tolerant ATM-Routings for Biconnected Graphs., , , and . WG, volume 1335 of Lecture Notes in Computer Science, page 354-367. Springer, (1997)Efficient Algorithms for a Mixed k-Partition Problem of Graphs without Specifying Bases., , and . WG, volume 903 of Lecture Notes in Computer Science, page 319-330. Springer, (1994)