Greedy routing and the algorithmic small-world phenomenon
type: Item
instance of: scholarly article
title: Greedy routing and the algorithmic small-world phenomenon
author: Karl Bringmann
author: Ralph Keusch
author: Johannes Lengler
author: Yannic Maus
author: Anisur Rahaman Molla
published in: Journal of Computer and System Sciences
publication date: 2022-01-31T00:00:00Z
full work available at URL: https://arxiv.org/abs/1612.05539
Mathematics Subject Classification ID: 68-XX
zbMATH DE Number: 7466699
zbMATH Keywords: small-world phenomenon
zbMATH Keywords: greedy routing
zbMATH Keywords: real-world networks
zbMATH Keywords: routing protocols
zbMATH Keywords: Internet routing
zbMATH Keywords: random graph models
describes a project that uses: WebGraph
MaRDI profile type: Publication
OpenAlex ID: W4205236046
cites work: The small-world phenomenon
cites work: Greedy Routing and the Algorithmic Small-World Phenomenon
cites work: Navigation in small-world networks: a scale-free continuum model
cites work: Analyzing Kleinberg's (and other) small-world Models
cites work: Eclecticism shrinks even small worlds
cites work: Know thy neighbor's neighbor
cites work: Networks Become Navigable as Nodes Move and Forget
cites work: Sampling Geometric Inhomogeneous Random Graphs in Linear Time
cites work: Geometric inhomogeneous random graphs
cites work: Navigation in spatial networks: a survey
cites work: Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane
cites work: On the Diameter of Hyperbolic Random Graphs
cites work: A Bound for the Diameter of Random Hyperbolic Graphs
cites work: Clustering and the Hyperbolic Geometry of Complex Networks
cites work: Random Hyperbolic Graphs: Degree Sequence and Clustering
cites work: On the searchability of small-world networks with arbitrary underlying structure
cites work: The average distances in random graphs with given expected degrees
cites work: Statistical mechanics of complex networks
cites work: A Brief History of Generative Models for Power Law and Lognormal Distributions
cites work: A Spatial Web Graph Model with Local Influence Regions
cites work: A Spatial Preferential Attachment Model with Local Clustering
cites work: Scale-free percolation
cites work: Structures in supercritical scale-free percolation
cites work: The phase transition in inhomogeneous random graphs
cites work: The Geometric Protean Model for On-Line Social Networks
cites work: The Structure of Geographical Threshold Graphs
cites work: Stability criteria and localization of the matrix spectrum in terms of trace functions
cites work: Hyperbolic Random Graphs: Separators and Treewidth
cites work: Greedy routing in small-world networks with power-law degrees
cites work: Algorithms – ESA 2005
cites work: Navigating Low-Dimensional and Hierarchical Population Networks
cites work: Could any graph be turned into a small-world?
cites work: A Doubling Dimension Threshold Θ(loglogn) for Augmented Graph Navigability
cites work: Object location using path separators
cites work: Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation
cites work: Distance estimation and object location via rings of neighbors
cites work: Upper and lower bounds for online routing on Delaunay triangulations
cites work: Bootstrap percolation on geometric inhomogeneous random graphs
cites work: Random Geometric Graphs
cites work: Location-aided routing (LAR) in mobile ad hoc networks
cites work: Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs
cites work: Not all interventions are equal for the height of the second peak
cites work: Q5002689
cites work: Typical distances in ultrasmall random networks
DOI: 10.1016/J.JCSS.2021.11.003
description: scientific article; zbMATH DE number 7466699