✦ LIBER ✦

A fast algorithm for constructing trees from distance matrices

✍ Scribed by Joseph C. Culberson; Piotr Rudnicki

Book ID: 113163455
Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 833 KB
Volume: 30
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(89)90216-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation and Exact Algorithms for C

Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices

✍ Bang Ye Wu; Kun-Mao Chao; Chuan Yi Tang 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 78 KB

An algorithm for tree-realizability of d

An algorithm for tree-realizability of distance matrices ∗

✍ Batagelj, Vladimir; Pisanski, Tomaž; Sim[otilde]es-Pereira, J. M. S. 📂 Article 📅 1990 🏛 Taylor and Francis Group 🌐 English ⚖ 269 KB

An algorithm for constructing edge-trees

An algorithm for constructing edge-trees from hypergraphs

✍ Fǎnicǎ Gavril; Robert Tamari 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 628 KB

A fast algorithm for constructing a tree

A fast algorithm for constructing a tree automaton recognizing a congruential tree language

✍ Sándor Vágvölgyi 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 547 KB

A Fast Recursive Algorithm for Construct

A Fast Recursive Algorithm for Constructing Matrices with Prescribed Eigenvalues and Singular Values

✍ Chu, Moody T. 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 207 KB

A fast algorithm for Steiner trees

✍ L. Kou; G. Markowsky; L. Berman 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 248 KB

Given an undirected distance graph G = (V, E, d) and a set S, where V is the set of vertices in G, E is the set of edges in G, d is a distance function which maps E into the set of nonnegative numbers and S___ V is a subset of the vertices of V, the Steiner tree problem is to find a tree of G that s