Constructing labeling schemes through universal matrices

DOI10.1007/s00453-008-9226-7zbMath1216.05133OpenAlexW1981752370MaRDI QIDQ973000

Amos Korman, Yoav Rodeh, David Peleg

Publication date: 28 May 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-008-9226-7

zbMATH Keywords

distanceadjacencylabeling schemesuniversal matrices

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

Randomized proof-labeling schemes ⋮ Local mending

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Labeling schemes for dynamic tree networks
• Nearest common ancestors: a survey and a new algorithm for a distributed environment
• Informative labeling schemes for graphs
• Labeling Dynamic XML Trees
• Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs
• Universal graphs and induced-universal graphs
• Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes
• Implicat Representation of Graphs
• Distributed Computing: A Locality-Sensitive Approach
• On minimal universal graphs for hereditary classes
• Distributed verification of minimum spanning trees
• On minimal n-universal graphs
• Distributed Computing
• Compact oracles for reachability and approximate distances in planar digraphs
• Universal graphs and universal functions

This page was built for publication: Constructing labeling schemes through universal matrices