PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Gu, Qian-Ping"

Author of the publication

copydeleteadd this publication to your clipboard
On the complexity and algorithm of grooming regular traffic in WDM optical networks.

, and . J. Parallel Distrib. Comput., 68 (6): 877-886 (2008)

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.

Junyuan Gu University of Stuttgart

Qian Du University of Stuttgart

Dr. Qian Xiong University of Stuttgart

Qian Song University of Stuttgart

Qian Zhou University of Stuttgart

 

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)Fault Tolerant Routing in Hypercubes and Star Graphs., and . Parallel Processing Letters, 6 (1): 127-136 (1996)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)Tight Bounds for Wavelength Assignment on Trees of Rings., , and . IPDPS, IEEE Computer Society, (2005)Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks., and . IPDPS, page 761-768. IEEE Computer Society, (2000)A Practical Algorithm for Embedding Graphs on Torus., and . IJNC, 6 (2): 149-166 (2016)Efficient Algorithms for Ridesharing of Personal Vehicles., , and . COCOA (1), volume 10627 of Lecture Notes in Computer Science, page 340-354. Springer, (2017)Optimal branch-decomposition of planar graphs in O(n3) Time., and . ACM Trans. Algorithms, 4 (3): 30:1-30:13 (2008)k-Pairwise Cluster Fault Tolerant Routing in Hypercubes., and . ISAAC, volume 834 of Lecture Notes in Computer Science, page 342-350. Springer, (1994)