Author of the publication

Finding a Routing Path of Optimal Length in Hypercubes with Fault Clusters.

, and . Parallel and Distributed Computing and Systems, page 229-233. IASTED/ACTA Press, (1995)

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.

 

Other publications of authors with the same name

Node-To-Set Disjoint Paths Problem in Star Graphs., and . Inf. Process. Lett., 62 (4): 201-207 (1997)Optimal branch-decomposition of planar graphs in O(n3) Time., and . ACM Trans. Algorithms, 4 (3): 30:1-30:13 (2008)Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem., and . ISAAC, volume 7074 of Lecture Notes in Computer Science, page 364-373. Springer, (2011)k-Pairwise Cluster Fault Tolerant Routing in Hypercubes., and . ISAAC, volume 834 of Lecture Notes in Computer Science, page 342-350. Springer, (1994)Fault Tolerant Routing in Hypercubes and Star Graphs., and . Parallel Process. Lett., 6 (1): 127-136 (1996)Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs., and . Discret. Appl. Math., (2019)Optimal Algorithms for Node-to-Node Fault Tolerant Routing in Hypercubes., and . Comput. J., 39 (7): 626-629 (1996)An Efficient Algorithm for Node-to-Node Routing in Hypercubes with Faulty Clusters., and . Comput. J., 39 (1): 14-19 (1996)Approximate ridesharing of personal vehicles problem., , and . Theor. Comput. Sci., (2021)A Practical Algorithm for Embedding Graphs on Torus., and . Int. J. Netw. Comput., 6 (2): 149-166 (2016)