Author of the publication

A Fast Algorithm for Constructing Trees from Distance Matrices.

, and . Inf. Process. Lett., 30 (4): 215-220 (1989)

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.

 

Other publications of authors with the same name

A Fast Algorithm for Constructing Trees from Distance Matrices., and . Inf. Process. Lett., 30 (4): 215-220 (1989)Simple Graphs as Simplicial Complexes: the Mycielskian of a Graph., and . Formaliz. Math., 20 (2): 161-174 (2012)The Mycielskian of a Graph., and . Formalized Mathematics, 19 (1): 27-34 (2011)On the Integrity of a Repository of Formalized Mathematics., and . MKM, volume 2594 of Lecture Notes in Computer Science, page 162-174. Springer, (2003)A Compendium of Continuous Lattices in MIZAR., and . J. Autom. Reason., 29 (3-4): 189-224 (2002)On Equivalents of Well-Foundedness., and . J. Autom. Reason., 23 (3-4): 197-234 (1999)Proving Properties of Pascal Programs in MIZAR 2., and . Acta Informatica, 22 (3): 311-331 (1985)Escape to ATP for Mizar., and . PxTP, page 46-59. (2011)Dynamic recognition of the configuration of bus networks., , and . Comput. Commun., 14 (4): 216-222 (1991)Uniform Self-Stabilizing Orientation of Unicyclic Networks under Read/Write Atomicity., and . Chic. J. Theor. Comput. Sci., (1996)