( en | de | ru )

 

Disambiguation of "Gu, Qian-Ping"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient algorithms for wavelength assignment on trees of rings.

, , and . Discret. Appl. Math., 157 (5): 875-889 (2009)

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.

Qian-Qian Jiang

Qian-Qian Jiang

Ping-Ping Tsai

Huihong Qian

Yanyun Qian

 

Other publications of authors with the same name

An Efficient Algorithm for k-Pairwise Disjoint Paths in Star Graphs., and . Inf. Process. Lett., 67 (6): 283-287 (1998)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)A Distributed Algorithm for Leader Election from a Partially Ordered Set on a Coterie., and . PDPTA, page 825-847. CSREA Press, (1997)Unicast in Hypercubes with Large Number of Faulty Nodes., and . IEEE Trans. Parallel Distributed Syst., 10 (10): 964-975 (1999)Multicolor routing in the undirected hypercube., and . Discret. Appl. Math., 100 (3): 169-181 (2000)Practical algorithms for branch-decompositions of planar graphs., , and . Discret. Appl. Math., (2016)Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs., and . WG, volume 8747 of Lecture Notes in Computer Science, page 238-249. Springer, (2014)Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n1 + ε) Time., and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 984-993. Springer, (2009)Computing Branch Decomposition of Large Planar Graphs., and . WEA, volume 5038 of Lecture Notes in Computer Science, page 87-100. Springer, (2008)Node-to-Set and Set-to-Set Cluster Fault Tolerant Routing in Hypercubes., and . Parallel Comput., 24 (8): 1245-1261 (1998)