On the Average Number of Edges in Theta Graphs
From MaRDI portal
Publication:5194764
DOI10.1137/1.9781611973204.12zbMath1430.68230arXiv1304.3402OpenAlexW2963673565MaRDI QIDQ5194764
Publication date: 17 September 2019
Published in: 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.3402
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Structural characterization of families of graphs (05C75) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)
Related Items
The \(\varTheta_5\)-graph is a spanner, The Stretch - Length Tradeoff in Geometric Networks: Average Case and Worst Case Study