2012/03/22 by John D. Hobby, Hobby, John D., Gabriel H. Tucci +1
Computer Science · Mathematics · #Combinatorics (math.CO) #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Data Management and Algorithms #Differential Geometry (math.DG) #FOS: Computer and information sciences #FOS: Mathematics #Networking and Internet Architecture (cs.NI) #Topological and Geometric Data Analysis #cs.CG #cs.NI #math.CO #math.DG
paper · pdf · doi:10.48550/arxiv.1203.4863
Submitted to the Journal of Discrete Computational Geometry
arxiv created 2012/03/22 · openalex publication_date 2012/03/22 · arxiv updated 2012/03/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this work we study the degree distribution, the maximum vertex and edge flow in non-uniform random Delaunay triangulations when geodesic routing is used. We also investigate the vertex and edge flow in Erdös-Renyi random graphs, geometric random graphs, expanders and random k-regular graphs. Moreover we show that adding a random matching to the original graph can considerably reduced the maximum vertex flow.