( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Practical algorithms for branch-decompositions of planar graphs.

, , и . Discret. Appl. Math., (2016)

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.

Qian-Qian Jiang

Qian-Qian Jiang

Ping-Ping Tsai

Huihong Qian

Yanyun Qian

 

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

Constant Query Time $(1 + ε)$-Approximate Distance Oracle for Planar Graphs., и . CoRR, (2017)Wavelength Assignment in Multifiber WDM Star and Spider Networks., и . ICC, стр. 2430-2435. IEEE, (2007)Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size., и . ISAAC (2), том 6507 из Lecture Notes in Computer Science, стр. 85-96. Springer, (2010)Optimal Branch-Decomposition of Planar Graphs in O(n3) Time., и . ICALP, том 3580 из Lecture Notes in Computer Science, стр. 373-384. Springer, (2005)On the complexity and algorithm of grooming regular traffic in WDM optical networks., и . J. Parallel Distributed Comput., 68 (6): 877-886 (2008)Routing in Hypercubes with Large Number of Faulty Nodes., и . ICPADS, стр. 718-. IEEE Computer Society, (1998)An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes., и . ICPADS, стр. 98-105. IEEE Computer Society, (1996)Algorithms for Node Disjoint Paths in Incomplete Star Networks., и . ICPADS, стр. 296-303. IEEE Computer Society, (1994)On-line Permutation Routing on WDM All-Optical Networks.. ICPP, стр. 419-428. IEEE Computer Society, (2002)Efficient Algorithms for Traffic Grooming in SONET/WDM Networks., и . ICPP, стр. 355-364. IEEE Computer Society, (2006)