Informative labeling schemes for graphs
From MaRDI portal
Publication:2566038
DOI10.1016/J.TCS.2005.03.015zbMATH Open1077.68078OpenAlexW1543879246MaRDI QIDQ2566038FDOQ2566038
Authors: David Peleg 
Publication date: 22 September 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.015
Recommendations
Cites Work
- Implicat Representation of Graphs
- A fast algorithm for Steiner trees
- An unexpected result in coding the vertices of a graph
- Distance labeling in graphs (extended abstract)
- Labelling and Implicit Routing in Networks
- Title not available (Why is that?)
- Coding the vertexes of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (20)
- Better distance labeling for unweighted planar graphs
- Constructing labeling schemes through universal matrices
- Online computation with advice
- Title not available (Why is that?)
- Labeling schemes for weighted dynamic trees
- Fault-tolerant distance labeling for planar graphs
- Fault-tolerant distance labeling for planar graphs
- Better distance labeling for unweighted planar graphs
- Distributed Data Structures: A Survey on Informative Labeling Schemes
- Ramsey partitions and proximity data structures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Shorter Labeling Schemes for Planar Graphs
- Proof labeling schemes
- Distance and routing labeling schemes for cube-free median graphs
- Compact separator decompositions in dynamic trees and applications to labeling schemes
- A dynamic distributed approach to representing proper interval graphs
- Title not available (Why is that?)
- Randomized proof-labeling schemes
- Labeling Schemes with Queries
This page was built for publication: Informative labeling schemes for graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2566038)
