Informative labeling schemes for graphs

DOI10.1016/j.tcs.2005.03.015zbMath1077.68078OpenAlexW1543879246MaRDI QIDQ2566038

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (16)

Better distance labeling for unweighted planar graphs ⋮ Proof labeling schemes ⋮ Compact separator decompositions in dynamic trees and applications to labeling schemes ⋮ Unnamed Item ⋮ Distance and routing labeling schemes for cube-free median graphs ⋮ Better distance labeling for unweighted planar graphs ⋮ Labeling schemes for weighted dynamic trees ⋮ Randomized proof-labeling schemes ⋮ Online computation with advice ⋮ Constructing labeling schemes through universal matrices ⋮ Unnamed Item ⋮ Ramsey partitions and proximity data structures ⋮ Fault-tolerant distance labeling for planar graphs ⋮ A dynamic distributed approach to representing proper interval graphs ⋮ Shorter Labeling Schemes for Planar Graphs ⋮ Fault-tolerant distance labeling for planar graphs

Cites Work

• A fast algorithm for Steiner trees
• An unexpected result in coding the vertices of a graph
• Labelling and Implicit Routing in Networks
• Implicat Representation of Graphs
• Coding the vertexes of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Informative labeling schemes for graphs