Publication:4736828
From MaRDI portal
zbMath1054.68100MaRDI QIDQ4736828
Pierre Fraigniaud, Cyril Gavoille
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2285/22850065.htm
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Compact and localized distributed data structures, Compact Routing in Unit Disk Graphs, Compact separator decompositions in dynamic trees and applications to labeling schemes, How much memory is needed for leader election, A note on models for graph representations, Compact routing messages in self-healing trees, How to meet when you forget: log-space rendezvous in arbitrary graphs, General compact labeling schemes for dynamic trees, Randomized proof-labeling schemes, Bounding the locality of distributed routing algorithms