scientific article; zbMATH DE number 1420896
From MaRDI portal
Publication:4944965
zbMATH Open0945.05053MaRDI QIDQ4944965FDOQ4944965
Authors: David Peleg 
Publication date: 8 October 2000
Title of this publication is not available (Why is that?)
Recommendations
- Proximity-preserving labeling schemes
- Distance labeling in graphs (extended abstract)
- Distance labeling in graphs
- Simpler, faster and shorter labels for distances in graphs
- scientific article; zbMATH DE number 1947376
- A note on exact distance labeling
- Labeling Schemes for Small Distances in Trees
- scientific article; zbMATH DE number 2079400
- Distance labeling scheme and split decomposition
- Algorithms and Computation
Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cited In (19)
- Constructing labeling schemes through universal matrices
- General compact labeling schemes for dynamic trees
- Informative labeling schemes for graphs
- Compact and localized distributed data structures
- Proximity-preserving labeling schemes
- Labeling schemes for weighted dynamic trees
- Distributed distance computation and routing with small messages
- Lossless prioritized embeddings
- List graphs and distance-consistent node labelings
- Max-stretch reduction for tree spanners
- Title not available (Why is that?)
- Average case analysis for tree labelling schemes
- Title not available (Why is that?)
- A note on models for graph representations
- Distance labeling schemes for well-separated graph classes
- Distance estimation and object location via rings of neighbors
- Randomized proof-labeling schemes
- Light spanners for high dimensional norms via stochastic decompositions
- Tree-decompositions with bags of small diameter
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4944965)
