On the longest path algorithm for reconstructing trees from distance matrices
From MaRDI portal
Publication:845904
DOI10.1016/J.IPL.2006.08.013zbMATH Open1191.68836OpenAlexW1991531041MaRDI QIDQ845904FDOQ845904
Authors: Lev Reyzin, Nikhil Srivastava 
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
Recommendations
- A fast algorithm for constructing trees from distance matrices
- An optimal algorithm to reconstruct trees from additive distance data
- An \(O(n \log n)\) time algorithm for computing the path-length distance between trees
- An algorithm for tree-realizability of distance matrices∗
- Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)
Cites Work
Cited In (10)
- An \(O(n \log n)\) time algorithm for computing the path-length distance between trees
- Title not available (Why is that?)
- An optimal algorithm to reconstruct trees from additive distance data
- A fast algorithm for constructing trees from distance matrices
- Reconstruction and verification of chordal graphs with a distance oracle
- Topology discovery of sparse random graphs with few participants
- Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
- Title not available (Why is that?)
- Exact learning of multitrees and almost-trees using path queries
- Near-linear query complexity for graph inference
This page was built for publication: On the longest path algorithm for reconstructing trees from distance matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845904)
