Labeling schemes for dynamic tree networks
DOI10.1007/S00224-003-1106-6zbMATH Open1101.68334OpenAlexW2073641778MaRDI QIDQ705063FDOQ705063
Authors: Amos Korman, David Peleg, Yoav Rodeh 
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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)
Cited In (20)
- Algorithms and Data Structures
- Labeling Dynamic XML Trees
- Short labeling schemes for topology recognition in wireless tree networks
- Constructing labeling schemes through universal matrices
- General compact labeling schemes for dynamic trees
- Dynamic labeled 2-structures
- Labeling schemes for weighted dynamic trees
- Improved compact routing schemes for dynamic trees
- Title not available (Why is that?)
- Implicit representation of relations
- A note on models for graph representations
- A note on labeling schemes for graph connectivity
- Title not available (Why is that?)
- Distributed Computing
- Compact separator decompositions in dynamic trees and applications to labeling schemes
- Dynamic and multi-functional labeling schemes
- A dynamic distributed approach to representing proper interval graphs
- Title not available (Why is that?)
- Compact routing messages in self-healing trees
- New bounds for the controller problem
This page was built for publication: Labeling schemes for dynamic tree networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q705063)
