A fast algorithm for constructing trees from distance matrices (Q1116346): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Properties of the distance matrix of a tree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Optimal Diagonal Tree Code / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Distance matrix of a graph and its realizability / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3680834 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The distance matrix of a graph and its tree realization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Submatrices of non-tree-realizable distance matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5530466 / rank | |||
Normal rank | |||
Latest revision as of 14:16, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for constructing trees from distance matrices |
scientific article |
Statements
A fast algorithm for constructing trees from distance matrices (English)
0 references
1989
0 references
We present an algorithm which, given a tree-realizable distance matrix, constructs the tree in optimal \(O(n^ 2)\) time. For trees of bounded degree k, the algorithm runs in O(k n \(log_ k n)\) time, and for random trees it apparently runs in O(n) average time. We show how the algorithm can be used to test tree-realizability of a distance matrix.
0 references
random trees
0 references
tree-realizability
0 references
distance matrix
0 references
