Pages that link to "Item:Q845904"
From MaRDI portal
The following pages link to On the longest path algorithm for reconstructing trees from distance matrices (Q845904):
Displaying 9 items.
- A fast algorithm for constructing trees from distance matrices (Q1116346) (← links)
- An optimal algorithm to reconstruct trees from additive distance data (Q1121819) (← links)
- Reconstruction and verification of chordal graphs with a distance oracle (Q2227489) (← links)
- An \(O(n \log n)\) time algorithm for computing the path-length distance between trees (Q2319639) (← links)
- Topology discovery of sparse random graphs with few participants (Q2844081) (← links)
- Near-Linear Query Complexity for Graph Inference (Q3448836) (← links)
- Learning and Verifying Graphs Using Queries with a Focus on Edge Counting (Q3520066) (← links)
- (Q4218433) (← links)
- (Q5874464) (← links)