scientific article; zbMATH DE number 7375947

DOI10.4230/LIPIcs.ICALP.2018.20zbMath1499.68255arXiv1805.03253MaRDI QIDQ5002689

Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry, Tobias Friedrich, Thomas Bläsius, Cedric Freiberger

Publication date: 28 July 2021

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

random graphshyperbolic geometryscale-free networksbidirectional shortest path

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Elementary problems in hyperbolic and elliptic geometries (51M09)

Related Items (5)

Scale-free network clustering in hyperbolic and other random graphs ⋮ Solving vertex cover in polynomial time on hyperbolic random graphs ⋮ Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. ⋮ From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial) ⋮ Greedy routing and the algorithmic small-world phenomenon

Uses Software

• SNAP
• KADABRA

Cites Work

• On the Diameter of Hyperbolic Random Graphs
• Hyperbolic Random Graphs: Separators and Treewidth
• Sampling Geometric Inhomogeneous Random Graphs in Linear Time
• Greedy Routing and the Algorithmic Small-World Phenomenon
• Concentration of Measure for the Analysis of Randomized Algorithms
• Unnamed Item
• Unnamed Item

This page was built for publication: