Constructing Labeling Schemes Through Universal Matrices

DOI10.1007/11940128_42zbMath1135.68521OpenAlexW1485993114MaRDI QIDQ5459136

Amos Korman, Yoav Rodeh, David Peleg

Publication date: 24 April 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11940128_42

zbMATH Keywords

Universal graphsLabeling schemesUniversal matrices

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (4)

The space complexity of sum labelling ⋮ Distributed Relationship Schemes for Trees ⋮ Labeling schemes for weighted dynamic trees ⋮ The space complexity of sum labelling

This page was built for publication: Constructing Labeling Schemes Through Universal Matrices