( en | de | ru )

 

Disambiguation of "Tang, Chuan Yi"

Author of the publication

copydeleteadd this publication to your clipboard
Optimum Communication Spanning Trees.

, , and . Handbook of Approximation Algorithms and Metaheuristics, Chapman and Hall/CRC, (2007)

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.

Yi Chuan Yang

Tang Tang

Jen-Yang Chuang

Shih-yu Chuang

Mei-Ling Chuang

 

Other publications of authors with the same name

Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs., , and . Inf. Process. Lett., 99 (2): 64-67 (2006)The summation and bottleneck minimization for single-step searching on weighted graphs., , and . Inf. Sci., 74 (1-2): 1-28 (1993)Light graphs with small routing cost., , and . Networks, 39 (3): 130-138 (2002)The Development of RFID in Healthcare in Taiwan., , and . ICEB, page 340-345. Academic Publishers/World Publishing Corporation, (2004)Parallel branch-and-bound approach with MPI technology in inferring chemical compounds with path frequency., , , , and . GrC, page 733-738. IEEE Computer Society, (2009)An Average Case Analysis of a Resolution Principle Algorithm in Mechanical Theorem Proving., , and . Ann. Math. Artif. Intell., 6 (1-3): 235-251 (1992)Approximation Algorithms for Some Optimum Communication Spanning Tree Problems., , and . ISAAC, volume 1533 of Lecture Notes in Computer Science, page 407-416. Springer, (1998)Effincient Domination of Permutation Graphs and Trapezoid Graphs., , and . COCOON, volume 1276 of Lecture Notes in Computer Science, page 232-241. Springer, (1997)Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices., , and . COCOON, volume 1449 of Lecture Notes in Computer Science, page 299-308. Springer, (1998)A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree., , , , and . COCOON, volume 1449 of Lecture Notes in Computer Science, page 279-288. Springer, (1998)