A fast algorithm for constructing trees from distance matrices
Information Processing Letters
On the complexity of distance-based evolutionary tree reconstruction
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On the longest path algorithm for reconstructing trees from distance matrices
Information Processing Letters
Improving the Efficiency of Network Topology Discovery
GPC-WORKSHOPS '08 Proceedings of the 2008 The 3rd International Conference on Grid and Pervasive Computing - Workshops
Traceroute probe method and forward IP path inference
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Hi-index | 0.00 |
In this paper, we propose an algorithm to reconstruct the set of nodes and their topology relationships, particularly in case of a topological tree where all edge weights are 1, given the set of terminal vertices or leaves and their pairwise distances or path lengths. Prüfer encoding and decoding techniques showed a one-to-one correspondence between n-labelled trees and n − 2-tuples of vertex labels. We consider Prüfer encoding technique in discovering the intermediate vertices from the end-to-end path length between all pairs of terminal vertices. The results are useful in inferring graph characteristics, topology in particular, in the field of network tomography where the internal structure and link-level performance are inferred from end-to-end measurements.