On the longest path algorithm for reconstructing trees from distance matrices

DOI10.1016/j.ipl.2006.08.013zbMath1191.68836OpenAlexW1991531041MaRDI QIDQ845904

Nikhil Srivastava, Lev Reyzin

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.08.013

zbMATH Keywords

analysis of algorithmsgraph algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Near-Linear Query Complexity for Graph Inference ⋮ Exact learning of multitrees and almost-trees using path queries ⋮ Unnamed Item ⋮ Learning and Verifying Graphs Using Queries with a Focus on Edge Counting ⋮ Reconstruction and verification of chordal graphs with a distance oracle ⋮ Topology discovery of sparse random graphs with few participants

Cites Work

• Unnamed Item
• Unnamed Item
• A fast algorithm for constructing trees from distance matrices
• An optimal algorithm to reconstruct trees from additive distance data
• Determining the Evolutionary Tree Using Experiments

This page was built for publication: On the longest path algorithm for reconstructing trees from distance matrices