On the public citation graph

On Computing the Gromov Hyperbolicity

0 signed · 63 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/eujc.2002.0591openalex-snapshot
Hyperbolic Bridged Graphs
inferredcites →https://doi.org/10.1007/978-1-4613-9586-7_3openalex-snapshot
Hyperbolic Groups
inferredcites →https://doi.org/10.1007/978-3-642-40698-0_6openalex-snapshot
Evaluating OpenMP Tasking at Scale for the Computation of Graph Hyperbolicity
inferredcites →https://doi.org/10.1007/978-3-642-54423-1_25openalex-snapshot
Approximation Algorithms for the Gromov Hyperbolicity of Discrete Metric Spaces
inferredcites →https://doi.org/10.1007/bf02020961openalex-snapshot
Transitiv orientierbare Graphen
inferredcites →https://doi.org/10.1007/s00026-001-8007-7openalex-snapshot
On the Hyperbolicity of Chordal Graphs
inferredcites →https://doi.org/10.1007/s00453-010-9478-xopenalex-snapshot
Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs
inferredcites →https://doi.org/10.1016/0012-365x(85)90051-2openalex-snapshot
Decomposition by clique separators
inferredcites →https://doi.org/10.1016/j.cosrev.2010.01.001openalex-snapshot
A survey of the algorithmic aspects of modular decomposition
inferredcites →https://doi.org/10.1016/j.dam.2008.08.008openalex-snapshot
Finding the longest isometric cycle in a graph
inferredcites →https://doi.org/10.1016/j.endm.2008.06.046openalex-snapshot
Notes on diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs
inferredcites →https://doi.org/10.1016/j.ipl.2015.02.002openalex-snapshot
Computing the Gromov hyperbolicity of a discrete metric space
inferredcites →https://doi.org/10.1016/j.tcs.2017.06.001openalex-snapshot
Applying clique-decomposition for computing Gromov hyperbolicity
inferredcites →https://doi.org/10.1017/cbo9781139019767openalex-snapshot
Basic Phylogenetic Combinatorics
inferredcites →https://doi.org/10.1038/ncomms1063openalex-snapshot
Sustaining the Internet with hyperbolic mapping
inferredcites →https://doi.org/10.1080/10618600.2012.640901openalex-snapshot
Computational Tools for Evaluating Phylogenetic and Hierarchical Clustering Trees
inferredcites →https://doi.org/10.1080/15427951.2014.1002640openalex-snapshot
Lack of Hyperbolicity in Asymptotic Erdös–Renyi Sparse Random Graphs
inferredcites →https://doi.org/10.1103/physreve.82.036106openalex-snapshot
Hyperbolic geometry of complex networks
inferredcites →https://doi.org/10.1103/physreve.84.066108openalex-snapshot
Large-scale curvature of networks
inferredcites →https://doi.org/10.1109/infcom.2010.5462131openalex-snapshot
Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces
inferredcites →https://doi.org/10.1109/nca.2011.11openalex-snapshot
Treewidth and Hyperbolicity of the Internet
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0603021openalex-snapshot
Decomposition of Directed Graphs
inferredcites →https://doi.org/10.1137/10080052xopenalex-snapshot
Linear Time Split Decomposition Revisited
inferredcites →https://doi.org/10.1137/140954787openalex-snapshot
Recognition of $C_4$-Free and 1/2-Hyperbolic Graphs
inferredcites →https://doi.org/10.1137/s0895480100380902openalex-snapshot
1-Hyperbolic Graphs
inferredcites →https://doi.org/10.1145/1096536.1096546openalex-snapshot
DIMES
inferredcites →https://doi.org/10.1145/1217299.1217301openalex-snapshot
Graph evolution
inferredcites →https://doi.org/10.1145/1412228.1455266openalex-snapshot
Fast computation of empirically tight bounds for the diameter of massive graphs
inferredcites →https://doi.org/10.1145/1555349.1555357openalex-snapshot
On the treeness of internet latency and bandwidth
inferredcites →https://doi.org/10.1145/1639562.1639568openalex-snapshot
Greedy forwarding in scale-free networks embedded in hyperbolic metric spaces
inferredcites →https://doi.org/10.1145/2020408.2020579openalex-snapshot
Friendship and mobility
inferredcites →https://doi.org/10.1145/2492101.1555357openalex-snapshot
On the treeness of internet latency and bandwidth
inferredcites →https://doi.org/10.23919/acc.1987openalex-snapshot
1987 American Control Conference
inferredcites →https://doi.org/10.23919/acc.2004.1386698openalex-snapshot
Geometry of network security
inferredcites →https://doi.org/10.32614/cran.package.distoryopenalex-snapshot
distory: Distance Between Phylogenetic Histories
inferredcites →https://doi.org/10.32614/r.manualsopenalex-snapshot
R: A Language and Environment for Statistical Computing
inferredcites →https://doi.org/10.3390/a3020197openalex-snapshot
An Introduction to Clique Minimal Separator Decomposition
inferredcites →https://doi.org/10.37236/530openalex-snapshot
Hyperbolicity and Chordality of a Graph
inferredcites →https://doi.org/10.4153/cjm-1980-057-7openalex-snapshot
A Combinatorial Decomposition Theory
inferredcites →https://doi.org/10.48550/arxiv.1307.0031openalex-snapshot
On the Hyperbolicity of Large-Scale Networks
inferredcites →https://doi.org/10.5555/1496770.1496813openalex-snapshot
Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-93409-5_17openalex-snapshot
Fellow Travelers Phenomenon Present in Real-World Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-93954-0_40-1openalex-snapshot
Gromov-Hyperbolic Graphs and Word-Hyperbolic Groups
inferred← citeshttps://doi.org/10.1007/978-3-032-16368-4_40openalex-snapshot
Gromov-Hyperbolic Graphs and Word-Hyperbolic Groups
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_34openalex-snapshot
When Can Graph Hyperbolicity Be Computed in Linear Time?
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_19openalex-snapshot
On Computing the Hyperbolicity of Real-World Graphs
inferred← citeshttps://doi.org/10.1007/s00453-018-0522-6openalex-snapshot
When Can Graph Hyperbolicity be Computed in Linear Time?
inferred← citeshttps://doi.org/10.1007/s00454-019-00107-9openalex-snapshot
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs
inferred← citeshttps://doi.org/10.1007/s11856-025-2809-zopenalex-snapshot
Discrete-time gradient flows in Gromov hyperbolic spaces
inferred← citeshttps://doi.org/10.1016/j.dam.2016.06.017openalex-snapshot
On the hyperbolicity of bipartite graphs and intersection graphs
inferred← citeshttps://doi.org/10.1016/j.entcs.2016.03.005openalex-snapshot
Into the Square: On the Complexity of Some Quadratic-time Solvable Problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.05.025openalex-snapshot
Data center interconnection networks are not hyperbolic
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.06.001openalex-snapshot
Applying clique-decomposition for computing Gromov hyperbolicity
inferred← citeshttps://doi.org/10.1137/1.9781611975031.176openalex-snapshot
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
inferred← citeshttps://doi.org/10.1137/1.9781611977042.7openalex-snapshot
Computing Graph Hyperbolicity Using Dominating Sets
inferred← citeshttps://doi.org/10.1145/3310228openalex-snapshot
Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
inferred← citeshttps://doi.org/10.1145/3569169openalex-snapshot
Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation
inferred← citeshttps://doi.org/10.1609/aaai.v35i8.16877openalex-snapshot
Computationally Tractable Riemannian Manifolds for Graph Embeddings
inferred← citeshttps://doi.org/10.24166/im.06.2017openalex-snapshot
Hyperbolicity, degeneracy, and expansion of random intersection graphs
inferred← citeshttps://doi.org/10.3390/sym9110255openalex-snapshot
Mathematical Properties on the Hyperbolicity of Interval Graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.12544openalex-snapshot
Leanness Computation: Small Values and Special Graph Classes
inferred← citeshttps://doi.org/10.48550/arxiv.1702.06503openalex-snapshot
When can Graph Hyperbolicity be computed in Linear Time?
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.