A note on exact distance labeling
type: Item
instance of: scholarly article
title: A note on exact distance labeling
zbMATH Open document ID: 1260.05054
author: Oren Weimann
author: David Peleg
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6150420
zbMATH Keywords: labeling schemes
zbMATH Keywords: shortest paths
zbMATH Keywords: graph algorithms
zbMATH Keywords: distributed systems
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.04.006
OpenAlex ID: W2074619214
cites work: Object location using path separators
cites work: Q4796196
cites work: Distance labeling in graphs
cites work: Q5663904
cites work: Traveling with a Pez Dispenser (or, Routing Issues in MPLS)
cites work: Proximity-preserving labeling schemes
cites work: Proof of the squashed cube conjecture
DOI: 10.1016/J.IPL.2011.04.006
Recommended article: Q4796196
Recommended article: Distance labeling in graphs (extended abstract)
Recommended article: Approximate distance labeling schemes
Recommended article: Q5397204
Recommended article: Q4940064
Recommended article: Exact algorithms for a discrete metric labeling problem
Recommended article: Distance labeling in graphs
Recommended article: Distance-two labelings of graphs
Recommended article: Algorithms and Computation
description: scientific article; zbMATH DE number 6150420