Reachability and Distance Queries via 2-Hop Labels
type: Item
instance of: scholarly article
title: Reachability and Distance Queries via 2-Hop Labels
zbMATH Open document ID: 1026.68165
DOI: 10.1137/S0097539702403098
author: Edith Cohen
author: Eran Halperin
author: Haim Kaplan
author: Uri Zwick
published in: SIAM Journal on Computing
publication date: 2003-09-28T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68R99
zbMATH DE Number: 1986357
zbMATH Keywords: shortest-path queries
zbMATH Keywords: reachability queries
zbMATH Keywords: distance labels
zbMATH Keywords: 2-hop labels
MaRDI profile type: Publication
full work available at URL: s0097539702403098
OpenAlex ID: W1994924587
Recommended article: Q4829033
Recommended article: Network Discovery and Verification with Distance Queries
Recommended article: Distance labeling in graphs (extended abstract)
Recommended article: Robust Distance Queries on Massive Networks
Recommended article: Q4796196
Recommended article: On Approximate Distance Labels and Routing Schemes with Affine Stretch
Recommended article: Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling
Recommended article: Q4940064
description: scientific article; zbMATH DE number 1986357