Spanners and Reachability Oracles for Directed Transmission Graphs

Authors Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth

Thumbnail PDF


  • Filesize: 0.52 MB
  • 15 pages

Document Identifiers

Author Details

Haim Kaplan
Wolfgang Mulzer
Liam Roditty
Paul Seiferth

Cite AsGet BibTex

Haim Kaplan, Wolfgang Mulzer, Liam Roditty, and Paul Seiferth. Spanners and Reachability Oracles for Directed Transmission Graphs. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 156-170, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)


Let P be a set of n points in d dimensions, each with an associated radius r_p > 0. The transmission graph G for P has vertex set P and an edge from p to q if and only if q lies in the ball with radius r_p around p. Let t > 1. A t-spanner H for G is a sparse subgraph of G such that for any two vertices p, q connected by a path of length l in G, there is a p-q-path of length at most tl in H. We show how to compute a t-spanner for G if d=2. The running time is O(n (log n + log Psi)), where Psi is the ratio of the largest and smallest radius of two points in P. We extend this construction to be independent of Psi at the expense of a polylogarithmic overhead in the running time. As a first application, we prove a property of the t-spanner that allows us to find a BFS tree in G for any given start vertex s of P in the same time. After that, we deal with reachability oracles for G. These are data structures that answer reachability queries: given two vertices, is there a directed path between them? The quality of a reachability oracle is measured by the space S(n), the query time Q(n), and the preproccesing time. For d=1, we show how to compute an oracle with Q(n) = O(1) and S(n) = O(n) in time O(n log n). For d=2, the radius ratio Psi again turns out to be an important measure for the complexity of the problem. We present three different data structures whose quality depends on Psi: (i) if Psi < sqrt(3), we achieve Q(n) = O(1) with S(n) = O(n) and preproccesing time O(n log n); (ii) if Psi >= sqrt(3), we get Q(n) = O(Psi^3 sqrt(n)) and S(n) = O(Psi^5 n^(3/2)); and (iii) if Psi is polynomially bounded in n, we use probabilistic methods to obtain an oracle with Q(n) = O(n^(2/3)log n) and S(n) = O(n^(5/3) log n) that answers queries correctly with high probability. We employ our t-spanner to achieve a fast preproccesing time of O(Psi^5 n^(3/2)) and O(n^(5/3) log^2 n) in case (ii) and (iii), respectively.
  • Transmission Graphs
  • Reachability Oracles
  • Spanner
  • Intersection Graph


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Jochen Alber and Jirí Fiala. Geometric separation and exact solutions for the parameterized independent set problem on disk graphs. J. Algorithms, 52(2):134-151, 2004. Google Scholar
  2. Azzedine Boukerche. Algorithms and Protocols for Wireless Sensor Networks. Wiley Series on Parallel and Distributed Computing). Wiley-IEEE Press, 1st edition, 2008. Google Scholar
  3. Sergio Cabello and Miha Jejĉiĉ. Shortest paths in intersection graphs of unit disks. Comput. Geom., 48(4):360-367, 2015. Google Scholar
  4. Paul Callahan and Rao Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM, 42(1):67-90, 1995. Google Scholar
  5. Paz Carmi, 2014. Personal communication. Google Scholar
  6. Timothy M. Chan. A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries. J. ACM, 57(3):Art. 16, 15, 2010. Google Scholar
  7. Brent N. Clark, Charles J. Colbourn, and David S. Johnson. Unit disk graphs. Discrete Math., 86(1-3):165-177, 1990. Google Scholar
  8. Thomas Cormen, Charles Leiserson, Ronald Rivest, and Clifford Stein. Introduction to Algorithms. MIT Press, 2nd edition, 2001. Google Scholar
  9. Martin Fürer and Shiva Prasad Kasiviswanathan. Spanners for geometric intersection graphs with applications. J. Comput. Geom., 3(1):31-64, 2012. Google Scholar
  10. Sariel Har-Peled. Geometric Approximation Algorithms. AMS, 2011. Google Scholar
  11. Jacob Holm, Eva Rotenberg, and Mikkel Thorup. Planar Reachability in Linear Space and Constant Time. CoRR, arXiv:1411.5867, 2014. Google Scholar
  12. Hiroshi Imai, Masao Iri, and Kazuo Murota. Voronoi Diagram in the Laguerre Geometry and its Applications. SICOMP, 14(1):93-105, 1985. Google Scholar
  13. D. Kirkpatrick. Optimal Search in Planar Subdivisions. SICOMP, 12(1):28-35, 1983. Google Scholar
  14. G. Narasimhan and M. Smid. Geometric spanner networks. Cambridge Univ. Press, 2007. Google Scholar
  15. David Peleg and Liam Roditty. Localized spanner construction for ad hoc networks with variable transmission range. TOSN, 7(3), 2010. Google Scholar
  16. P. v. Rickenbach, R. Wattenhofer, and A. Zollinger. Algorithmic Models of Interference in Wireless Ad Hoc and Sensor Networks. IEEE ACM T NETWORK, 17(1):172-185, 2009. Google Scholar
  17. Andrew Chi-Chih Yao. On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems. SICOMP, 11(4):721-736, 1982. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail