Labeling schemes for dynamic tree networks
From MaRDI portal
Publication:705063
DOI10.1007/s00224-003-1106-6zbMath1101.68334OpenAlexW2073641778MaRDI QIDQ705063
Yoav Rodeh, David Peleg, Amos Korman
Publication date: 25 January 2005
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-003-1106-6
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15)
Related Items (10)
Compact separator decompositions in dynamic trees and applications to labeling schemes ⋮ Compact routing messages in self-healing trees ⋮ Implicit representation of relations ⋮ General compact labeling schemes for dynamic trees ⋮ New bounds for the controller problem ⋮ Labeling schemes for weighted dynamic trees ⋮ Constructing labeling schemes through universal matrices ⋮ A note on models for graph representations ⋮ A note on labeling schemes for graph connectivity ⋮ A dynamic distributed approach to representing proper interval graphs
This page was built for publication: Labeling schemes for dynamic tree networks
