Metric Embedding, Hyperbolic Space, and Social Networks
From MaRDI portal
Publication:4635576
DOI10.1145/2582112.2582139zbMATH Open1395.05048OpenAlexW2042662336MaRDI QIDQ4635576FDOQ4635576
Publication date: 23 April 2018
Published in: Proceedings of the thirtieth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2582112.2582139
Randomized algorithms (68W20) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cited In (15)
- From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial)
- The hyperbolicity constant of infinite circulant graphs
- Fast approximation and exact computation of negative curvature parameters of graphs
- On the hyperbolicity constant in graph minors
- Title not available (Why is that?)
- Obstructions to a small hyperbolicity in Helly graphs
- Gromov hyperbolicity in the Cartesian sum of graphs
- On a classical theorem on the diameter and minimum degree of a graph
- Data center interconnection networks are not hyperbolic
- Applying clique-decomposition for computing Gromov hyperbolicity
- Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry
- Gromov hyperbolicity in lexicographic product graphs
- Fast approximation of eccentricities and distances in hyperbolic graphs
- Tree decompositions and social graphs
- Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs
This page was built for publication: Metric Embedding, Hyperbolic Space, and Social Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635576)