Spanning Trees and Spanners

By David Eppstein. Handbook of Computational Geometry, 2000

347 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Signal Processing

View Paper: https://www.semanticscholar.org/paper/9e88e28b561930f0ffddb306d1a661304a0cd513

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Biswanath Mukherjee
2. Eiman Mohammed Alotaibi
3. Leonidas J. Guibas

In Computer Graphics and Computer-Aided Design

1. Biswanath Mukherjee
2. John Hershberger
3. Jie Gao
4. Li Zhang
5. Eiman Mohammed Alotaibi
6. Leonidas J. Guibas
7. An Zhu

In Signal Processing

1. Biswanath Mukherjee
2. Eiman Mohammed Alotaibi
3. Anushka Anand
4. Leonidas J. Guibas
5. Kristen Grauman
6. Ofir Pele
7. Sarah Jane Delany
8. Michael Werman

Citations in the corpus

• A survey on routing algorithms for wireless Ad-Hoc and mesh networks (2012, positive): “FACE [15] is a distributed Geographical routing algorithm based on a unit graph(10) (in which two nodes can communicate if the Euclidean distance [34] between them is less than some fixed amount).”
• Geometric spanners for routing in mobile networks (2001, background): “Spanner graphs have been heavily studied in computational geometry [10].”
• Graph-theoretic scagnostics (2005, background): “Because it jumps to nearest neighbors, the MST has a dilation of O(n) [11].”