Fellow travelers phenomenon present in real-world networks
From MaRDI portal
Publication:2086588
DOI10.1007/978-3-030-93409-5_17zbMath1506.05193OpenAlexW4205282155MaRDI QIDQ2086588
Feodor F. Dragan, Abdulhakeem O. Mohammed, Heather M. Guarnera
Publication date: 25 October 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-93409-5_17
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Nonnumerical algorithms (68W05) Structural characterization of families of graphs (05C75)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Hyperbolicity and chordality of a graph
- Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov)
- Obstructions to a small hyperbolicity in Helly graphs
- Fast approximation algorithms for \(p\)-centers in large \(\delta \)-hyperbolic graphs
- Computing the Gromov hyperbolicity of a discrete metric space
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs
- Fast approximation and exact computation of negative curvature parameters of graphs
- On Computing the Gromov Hyperbolicity
- Euclidean versus Hyperbolic Congestion in Idealized versus Experimental Networks
- On Computing the Hyperbolicity of Real-World Graphs
- Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
- Packing and Covering δ-Hyperbolic Spaces by Balls
- On the power of BFS to determine a graph's diameter
- Core congestion is inherent in hyperbolic networks
- Cop and Robber Game and Hyperbolicity
- Slimness of graphs
- Approximation Algorithms for the Gromov Hyperbolicity of Discrete Metric Spaces
