A Bound for the Diameter of Random Hyperbolic Graphs

DOI10.1137/1.9781611973761.3zbMath1430.05112arXiv1408.2947OpenAlexW2962815695MaRDI QIDQ5194791

Dieter Mitsche, Marcos A. Kiwi

Publication date: 17 September 2019

Published in: 2015 Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.2947

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

On the Diameter of Hyperbolic Random Graphs ⋮ On the Diameter of Hyperbolic Random Graphs ⋮ Sub-tree counts on hyperbolic random geometric graphs ⋮ Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry ⋮ Bootstrap percolation and the geometry of complex networks ⋮ Solving vertex cover in polynomial time on hyperbolic random graphs ⋮ Geometric inhomogeneous random graphs ⋮ Updating Dynamic Random Hyperbolic Graphs in Sublinear Time ⋮ The diameter of KPKVB random graphs ⋮ Limit theory for isolated and extreme points in hyperbolic random geometric graphs ⋮ Clustering in a hyperbolic model of complex networks ⋮ Typical distances in a geometric model for complex networks ⋮ From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial) ⋮ On the largest component of subcritical random hyperbolic graphs ⋮ Greedy routing and the algorithmic small-world phenomenon ⋮ On the Second Largest Component of Random Hyperbolic Graphs ⋮ Sampling Geometric Inhomogeneous Random Graphs in Linear Time ⋮ Mathematical properties on the hyperbolicity of interval graphs