Hyperbolic Diameter
Hyperbolic Diameter is a metric in network analysis that quantifies the longest shortest path between any two nodes in a graph embedded within hyperbolic geometric space, distinguishing itself from classical diameter measures by incorporating negative curvature to reflect intrinsic hierarchical and scale-free structural properties of complex networks.
13
Publications
484
Citations
25
Authors
14
Institutions
Publications per year
2017–2026
3
Parents
13
On the Hyperbolicity of Chordal Graphs
Gunnar Brinkmann, Jack H. Koolen · Annals of Combinatorics · 2001 · 92 citations
The size of a hyperbolic Coxeter simplex
Norman W. Johnson, Ruth Kellerhals, John G. Ratcliffe et al. · Transformation Groups · 1999 · 71 citations
1–5 of 13
25
3
h-index
Laboratoire d’Informatique Fondamentale de Marseille, France
2 publications · 150 citations
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 25
14
Kent State University
Kent, United States
3 h-index
4 publications
172 citations
Laboratoire d'Informatique Algorithmique: Fondements et Applications
Paris, France
2 h-index
2 publications
150 citations
Institut de Neurobiologie de la Méditerranée
Marseille, France
2 h-index
6 publications
450 citations
University of California, Santa Cruz
Santa Cruz, United States
2 h-index
2 publications
52 citations
Nokia (United States)
Coppell, United States
2 h-index
4 publications
104 citations
Université Paris Cité
Paris, France
2 h-index
2 publications
150 citations
Institute of Physics Belgrade
Belgrade, Serbia
1 h-index
1 publications
14 citations
Jožef Stefan Institute
Ljubljana, Slovenia
1 h-index
1 publications
14 citations
1–8 of 14
Repository · 2 publications · 42 citations
2
h-index
1 publications · 11 citations
1
h-index
1 publications · 10 citations
1
h-index
1 publications · 14 citations
1
h-index
AC · 1 publications · 92 citations
1
h-index
1–5