( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Edge and Node Searching Problems on Trees.

, , , , и . COCOON, том 1276 из Lecture Notes in Computer Science, стр. 284-293. Springer, (1997)

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.

Yi Chuan Yang

Tang Tang

Shih-yu Chuang

Jen-Yang Chuang

Mei-Ling Chuang

 

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

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