A fast algorithm for constructing trees from distance matrices
Information Processing Letters
Determining the evolutionary tree using experiments
Journal of Algorithms
On the complexity of distance-based evolutionary tree reconstruction
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Topology discovery of sparse random graphs with few participants
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Topology discovery of sparse random graphs with few participants
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Graph reconstruction via distance oracles
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Tree topology inference from leaf-to-leaf path lengths using Prüfer sequence
International Journal of Communication Networks and Distributed Systems
Hi-index | 0.89 |
Culberson and Rudnicki [J.C. Culberson, P. Rudnicki, A fast algorithm for constructing trees from distance matrices, Inform. Process. Lett. 30 (4) (1989) 215-220] gave an algorithm that reconstructs a degree d restricted tree from its distance matrix. According to their analysis, it runs in time O(dnlog"dn) for topological trees. However, this turns out to be false; we show that the algorithm takes @Q(n^3^/^2d) time in the topological case, giving tight examples.