Document

# Triangles and Girth in Disk Graphs and Transmission Graphs

## File

LIPIcs.ESA.2019.64.pdf
• Filesize: 0.5 MB
• 14 pages

## Acknowledgements

We like to thank Günther Rote and Valentin Polishchuk for helpful comments.

## Cite As

Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, and Micha Sharir. Triangles and Girth in Disk Graphs and Transmission Graphs. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 64:1-64:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/LIPIcs.ESA.2019.64

## Abstract

Let S subset R^2 be a set of n sites, where each s in S has an associated radius r_s > 0. The disk graph D(S) is the undirected graph with vertex set S and an undirected edge between two sites s, t in S if and only if |st| <= r_s + r_t, i.e., if the disks with centers s and t and respective radii r_s and r_t intersect. Disk graphs are used to model sensor networks. Similarly, the transmission graph T(S) is the directed graph with vertex set S and a directed edge from a site s to a site t if and only if |st| <= r_s, i.e., if t lies in the disk with center s and radius r_s. We provide algorithms for detecting (directed) triangles and, more generally, computing the length of a shortest cycle (the girth) in D(S) and in T(S). These problems are notoriously hard in general, but better solutions exist for special graph classes such as planar graphs. We obtain similarly efficient results for disk graphs and for transmission graphs. More precisely, we show that a shortest (Euclidean) triangle in D(S) and in T(S) can be found in O(n log n) expected time, and that the (weighted) girth of D(S) can be found in O(n log n) expected time. For this, we develop new tools for batched range searching that may be of independent interest.

## Subject Classification

##### ACM Subject Classification
• Theory of computation → Computational geometry
• Theory of computation → Graph algorithms analysis
##### Keywords
• disk graph
• transmission graph
• triangle
• girth

## Metrics

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

## References

1. Noga Alon, Raphael Yuster, and Uri Zwick. Finding and Counting Given Length Cycles. Algorithmica, 17(3):209-223, 1997.
2. Mark Bergde Berg, Otfried Cheong, Marc van Kreveld, and Mark H. Overmars. Computational Geometry: Algorithms and Applications. Springer-Verlag, third edition, 2008.
3. Kevin Buchin, Maarten Löffler, Pat Morin, and Wolfgang Mulzer. Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended. Algorithmica, 61(3):674-693, 2011.
4. Kevin Buchin and Wolfgang Mulzer. Delaunay triangulations in O(sort(n)) time and more. J. ACM, 58(2):6:1-6:27, 2011.
5. Timothy M. Chan. Geometric Applications of a Randomized Optimization Technique. Discrete Comput. Geom., 22(4):547-567, 1999.
6. Timothy M. Chan. A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions. Discrete Comput. Geom., 56(4):860-865, December 2016.
7. Hsien-Chih Chang and Hsueh-I Lu. Computing the Girth of a Planar Graph in Linear Time. SIAM J. Comput., 42(3):1077-1094, 2013.
8. Bernard Chazelle and Wolfgang Mulzer. Computing Hereditary Convex Structures. Discrete Comput. Geom., 45(4):796-823, 2011.
9. William S. Evans, Mereke van Garderen, Maarten Löffler, and Valentin Polishchuk. Recognizing a DOG is Hard, But Not When It is Thin and Unit. In Proc. 8th FUN, pages 16:1-16:12, 2016.
10. François GallLe Gall. Powers of tensors and fast matrix multiplication. In Proc. 39th Internat. Symp. Symbolic and Algebraic Comput. (ISSAC), pages 296-303, 2014.
11. Sariel Har-Peled. Geometric approximation algorithms. American Mathematical Society, 2008.
12. Alon Itai and Michael Rodeh. Finding a Minimum Circuit in a Graph. SIAM J. Comput., 7(4):413-423, 1978.
13. Haim Kaplan, Wolfgang Mulzer, Liam Roditty, and Paul Seiferth. Spanners and Reachability Oracles for Directed Transmission Graphs. In Proc. 31st Int. Sympos. Comput. Geom. (SoCG), pages 156-170, 2015.
14. Haim Kaplan, Wolfgang Mulzer, Liam Roditty, and Paul Seiferth. Spanners for Directed Transmission Graphs. SIAM J. Comput., 47(4):1585-1609, 2018.
15. Jakub Ła̧cki and Piotr Sankowski. Min-cuts and shortest cycles in planar graphs in O(n log log n) time. In Proc. 19th Annu. European Sympos. Algorithms (ESA), pages 155-166, 2011.
16. Shay Mozes, Kirill Nikolaev, Yahav Nussbaum, and Oren Weimann. Minimum Cut of Directed Planar Graphs in O(n log log n) Time. In Proc. 29th Annu. ACM-SIAM Sympos. Discrete Algorithms (SODA), pages 477-494, 2018.
17. Christos H. Papadimitriou and Mihalis Yannakakis. The Clique Problem for Planar Graphs. Inform. Process. Lett., 13(4/5):131-133, 1981.
18. Valentin Polishchuk. Personal communication, 2017.
19. Liam Roditty and Virginia Vassilevska Williams. Minimum Weight Cycles and Triangles: Equivalences and Algorithms. In Proc. 52nd Annu. IEEE Sympos. Found. Comput. Sci. (FOCS), pages 180-189, 2011.
20. Dan E. Willard and George S. Lueker. Adding Range Restriction Capability to Dynamic Data Structures. J. ACM, 32(3):597-617, 1985.
21. Virginia Vassilevska Williams and R. Ryan Williams. Subcubic Equivalences Between Path, Matrix, and Triangle Problems. J. ACM, 65(5):27:1-27:38, 2018.
22. Huacheng Yu. An Improved Combinatorial Algorithm for Boolean Matrix Multiplication. In Proc. 42nd Internat. Colloq. Automata Lang. Program. (ICALP), pages 1094-1105, 2015.
23. Raphael Yuster. A shortest cycle for each vertex of a graph. Inform. Process. Lett., 111(21-22):1057-1061, 2011.