( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The summation and bottleneck minimization for single-step searching on weighted graphs.

, , и . Inf. Sci., 74 (1-2): 1-28 (1993)

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

Jing-Jing Chuang

 

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

Chronic Kidney Disease Survival Prediction with Artificial Neural Networks., , , , и . BIBM, стр. 1351-1356. IEEE Computer Society, (2018)Drug resistance gene identification algorithm for next-generation sequencing data., , , и . BIBM, стр. 17-21. IEEE Computer Society, (2014)The Bottleneck Tree Alignment Problems., и . ICCSA (3), том 3982 из Lecture Notes in Computer Science, стр. 631-637. Springer, (2006)Using Conflicts to Derive Efficient Algorithms on the Single-Channel Broadcast Communication Model., и . J. Inf. Sci. Eng., 8 (2): 187-206 (1992)Effincient Domination of Permutation Graphs and Trapezoid Graphs., , и . COCOON, том 1276 из Lecture Notes in Computer Science, стр. 232-241. Springer, (1997)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)An Average Case Analysis of a Resolution Principle Algorithm in Mechanical Theorem Proving., , и . Ann. Math. Artif. Intell., 6 (1-3): 235-251 (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)