On the public citation graph

Treewidth and Hyperbolicity of the Internet

0 signed · 88 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.1007/11533719_45openalex-snapshot
Efficient and Simple Generation of Random Simple Connected Graphs with Prescribed Degree Sequence
inferredcites →https://doi.org/10.1007/11602613_106openalex-snapshot
Distance Labeling in Hyperbolic Graphs
inferredcites →https://doi.org/10.1007/3-540-19488-6_110openalex-snapshot
Dynamic programming on graphs with bounded treewidth
inferredcites →https://doi.org/10.1007/3-540-45465-9_11openalex-snapshot
Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet
inferredcites →https://doi.org/10.1007/978-1-4613-9586-7_3openalex-snapshot
Hyperbolic Groups
inferredcites →https://doi.org/10.1007/978-3-540-74208-1_5openalex-snapshot
Packing and Covering δ-Hyperbolic Spaces by Balls
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/0095-8956(83)90079-5openalex-snapshot
Graph minors. I. Excluding a forest
inferredcites →https://doi.org/10.1017/cbo9780511662119.006openalex-snapshot
Tree Width and Tangles: A New Connectivity Measure and Some Applications
inferredcites →https://doi.org/10.1103/physreve.84.066108openalex-snapshot
Large-scale curvature of networks
inferredcites →https://doi.org/10.1109/infcom.1997.644557openalex-snapshot
An analysis of Internet inter-domain topology and route stability
inferredcites →https://doi.org/10.1109/infcom.2002.1019258openalex-snapshot
Predicting Internet network distance with coordinates-based approaches
inferredcites →https://doi.org/10.1109/infcom.2002.1019306openalex-snapshot
The origin of power laws in Internet topologies revisited
inferredcites →https://doi.org/10.1109/infcom.2004.1354495openalex-snapshot
Compact routing on internet-like graphs
inferredcites →https://doi.org/10.1109/infocom.2008.163openalex-snapshot
The Inframetric Model for the Internet
inferredcites →https://doi.org/10.1109/tnet.2003.822655openalex-snapshot
Measuring ISP Topologies With Rocketfuel
inferredcites →https://doi.org/10.1109/tnet.2007.899021openalex-snapshot
Hyperbolic Embedding of Internet Graph for Distance Estimation and Overlay Construction
inferredcites →https://doi.org/10.1109/tnet.2009.2020798openalex-snapshot
The (In)Completeness of the Observed Internet AS-level Structure
inferredcites →https://doi.org/10.1117/12.434393openalex-snapshot
Internet topology: connectivity of IP graphs
inferredcites →https://doi.org/10.1126/science.286.5439.509openalex-snapshot
Emergence of Scaling in Random Networks
inferredcites →https://doi.org/10.1137/0608024openalex-snapshot
Complexity of Finding Embeddings in a k -Tree
inferredcites →https://doi.org/10.1145/1015467.1015471openalex-snapshot
Vivaldi
inferredcites →https://doi.org/10.1145/1030194.1015471openalex-snapshot
Vivaldi
inferredcites →https://doi.org/10.1145/1096536.1096546openalex-snapshot
DIMES
inferredcites →https://doi.org/10.1145/1273445.1273450openalex-snapshot
On compact routing for the internet
inferredcites →https://doi.org/10.1145/1377676.1377687openalex-snapshot
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
inferredcites →https://doi.org/10.1145/1400751.1400810openalex-snapshot
On the internet delay space dimensionality
inferredcites →https://doi.org/10.1145/1452520.1452541openalex-snapshot
On the internet delay space dimensionality
inferredcites →https://doi.org/10.1145/1555349.1555357openalex-snapshot
On the treeness of internet latency and bandwidth
inferredcites →https://doi.org/10.1145/1644893.1644937openalex-snapshot
Quantifying ases multiconnectivity using multicast information
inferredcites →https://doi.org/10.1145/1658939.1658964openalex-snapshot
Where the sidewalk ends
inferredcites →https://doi.org/10.1145/280549.280555openalex-snapshot
On routes and multicast trees in the Internet
inferredcites →https://doi.org/10.1145/316188.316229openalex-snapshot
On power-law relationships of the Internet topology
inferredcites →https://doi.org/10.1145/316194.316229openalex-snapshot
On power-law relationships of the Internet topology
inferredcites →https://doi.org/10.1145/633025.633040openalex-snapshot
Network topology generators
inferredcites →https://doi.org/10.1515/9781400836123-015openalex-snapshot
Mathematics and the Internet: A Source of Enormous Confusion and Great Potential
inferredcites →https://doi.org/10.48550/arxiv.0904.2716openalex-snapshot
Fast dynamics in Internet topology: preliminary observations and explanations

What points at this work

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

inferred← citeshttps://doi.org/10.1002/mma.9074openalex-snapshot
Geometric and topological properties of the complementary prism networks
inferred← citeshttps://doi.org/10.1002/net.21631openalex-snapshot
Metric tree‐like structures in real‐world networks: an empirical study
inferred← citeshttps://doi.org/10.1002/net.21800openalex-snapshot
Domain clustering for inter‐domain path computation speed‐up
inferred← citeshttps://doi.org/10.1007/978-3-030-03232-6_4openalex-snapshot
On Underlay-Aware Self-Stabilizing Overlay Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-61732-5_3openalex-snapshot
A Review of Two Network Curvature Measures
inferred← citeshttps://doi.org/10.1007/978-3-319-16112-9_7openalex-snapshot
Core-Periphery Models for Graphs Based on their δ-Hyperbolicity: An Example Using Biological Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-30569-1_18openalex-snapshot
The Network of Genetic Admixture in Humans
inferred← citeshttps://doi.org/10.1007/978-3-319-44543-4_1openalex-snapshot
On the Complexity of Computing Treebreadth
inferred← citeshttps://doi.org/10.1007/978-3-319-89932-9_2openalex-snapshot
δ-Hyperbolicity and the Core-Periphery Structure in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_54openalex-snapshot
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_31openalex-snapshot
On the Hyperbolicity of Small-World and Tree-Like Random Graphs
inferred← citeshttps://doi.org/10.1007/s00453-014-9871-yopenalex-snapshot
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth
inferred← citeshttps://doi.org/10.1007/s00453-017-0291-7openalex-snapshot
Effect of Gromov-Hyperbolicity Parameter on Cuts and Expansions in Graphs and Some Algorithmic Implications
inferred← citeshttps://doi.org/10.1007/s00453-019-00657-7openalex-snapshot
On the Complexity of Computing Treebreadth
inferred← citeshttps://doi.org/10.1007/s00453-019-00665-7openalex-snapshot
Why Did the Shape of Your Network Change? (On Detecting Network Anomalies via Non-local Curvatures)
inferred← citeshttps://doi.org/10.1007/s00453-025-01344-6openalex-snapshot
Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs
inferred← citeshttps://doi.org/10.1007/s00778-013-0338-6openalex-snapshot
Answering exact distance queries on real-world graphs with bounded performance guarantees
inferred← citeshttps://doi.org/10.1007/s10114-017-6324-yopenalex-snapshot
On a classical theorem on the diameter and minimum degree of a graph
inferred← citeshttps://doi.org/10.1007/s10922-025-09932-1openalex-snapshot
Deterministic Scheduling of Periodic Messages for Low Latency in Cloud RAN
inferred← citeshttps://doi.org/10.1007/s11128-016-1394-9openalex-snapshot
Differential geometric treewidth estimation in adiabatic quantum computation
inferred← citeshttps://doi.org/10.1007/s12220-020-00407-0openalex-snapshot
Isoperimetric Inequalities in Riemann Surfaces and Graphs
inferred← citeshttps://doi.org/10.1007/s13398-021-01096-2openalex-snapshot
A note on isoperimetric inequalities of Gromov hyperbolic manifolds and graphs
inferred← citeshttps://doi.org/10.1007/s41980-018-0032-yopenalex-snapshot
On the Hyperbolicity Constant in Graph Minors
inferred← citeshttps://doi.org/10.1007/s41980-018-0055-4openalex-snapshot
Gromov Hyperbolicity in the Cartesian Sum of Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.06.041openalex-snapshot
Several extremal problems on graphs involving the circumference, girth, and hyperbolicity constant
inferred← citeshttps://doi.org/10.1016/j.disc.2018.10.017openalex-snapshot
Obstructions to a small hyperbolicity in Helly graphs
inferred← citeshttps://doi.org/10.1080/15427951.2013.828336openalex-snapshot
On the Hyperbolicity of Small-World and Treelike Random Graphs
inferred← citeshttps://doi.org/10.1103/physreva.98.062328openalex-snapshot
Unitary entanglement construction in hierarchical networks
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00101openalex-snapshot
Explicit near-fully X-Ramanujan graphs
inferred← citeshttps://doi.org/10.1109/icdm.2013.77openalex-snapshot
Tree-Like Structure in Large Social and Information Networks
inferred← citeshttps://doi.org/10.1137/1.9781611974782.149openalex-snapshot
Core congestion is inherent in hyperbolic networks
inferred← citeshttps://doi.org/10.1137/15m1034039openalex-snapshot
To Approximate Treewidth, Use Treelength!
inferred← citeshttps://doi.org/10.1142/s021919971750050xopenalex-snapshot
Cheeger isoperimetric constant of Gromov hyperbolic manifolds and graphs
inferred← citeshttps://doi.org/10.1145/2780652openalex-snapshot
On Computing the Gromov Hyperbolicity
inferred← citeshttps://doi.org/10.1145/2872518.2888602openalex-snapshot
Structural Properties in δ-Hyperbolic Networks
inferred← citeshttps://doi.org/10.1145/3558481.3591080openalex-snapshot
A Tight Characterization of Fast Failover Routing: Resiliency to Two Link Failures is Possible
inferred← citeshttps://doi.org/10.1177/1748301816665519openalex-snapshot
Core–periphery models for graphs based on their δ -hyperbolicity: An example using biological networks
inferred← citeshttps://doi.org/10.1214/20-aihp1134openalex-snapshot
Coexistence of competing first passage percolation on hyperbolic graphs
inferred← citeshttps://doi.org/10.1515/math-2017-0061openalex-snapshot
The hyperbolicity constant of infinite circulant graphs
inferred← citeshttps://doi.org/10.22541/au.166148821.16285794/v1openalex-snapshot
CMMSE Geometric and topological properties of the complementary prism networks
inferred← citeshttps://doi.org/10.23638/dmtcs-21-3-10openalex-snapshot
Slimness of graphs
inferred← citeshttps://doi.org/10.3390/sym10070279openalex-snapshot
Hyperbolicity of Direct Products of Graphs
inferred← citeshttps://doi.org/10.3390/sym9080131openalex-snapshot
Gromov Hyperbolicity in Mycielskian Graphs
inferred← citeshttps://doi.org/10.47443/dml.2022.179openalex-snapshot
Recent Results on Hyperbolicity on Unitary Operators on Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1201.1717openalex-snapshot
On the Hyperbolicity of Small-World and Tree-Like Random Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1402.3364openalex-snapshot
Metric tree-like structures in real-life networks: an empirical study
inferred← citeshttps://doi.org/10.48550/arxiv.1404.5002openalex-snapshot
A Geometric Distance Oracle for Large Real-World Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2108.06436openalex-snapshot
Congestion in networks and manifolds, and fair-division problems
inferred← citeshttps://doi.org/10.5555/3192424.3192455openalex-snapshot
On the δ-hyperbolicity in complex networks
inferred← citeshttps://doi.org/10.70675/6bfbd981zab8fz4b87zb688zfcbeee4e4a2fopenalex-snapshot
Deterministic scheduling of periodic datagrams for low latency in 5G and beyond
inferred← citeshttps://doi.org/10.70675/ac2de31cz3ab1z4dcbzaf83z5b155a057a8dopenalex-snapshot
Large scale platform : Instantiable models and algorithmic design of communication schemes
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.