scientific article; zbMATH DE number 2086374
From MaRDI portal
Publication:4736828
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (10)
Bounding the locality of distributed routing algorithms ⋮ Compact separator decompositions in dynamic trees and applications to labeling schemes ⋮ 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 ⋮ Compact and localized distributed data structures ⋮ How much memory is needed for leader election ⋮ Compact Routing in Unit Disk Graphs ⋮ Randomized proof-labeling schemes ⋮ A note on models for graph representations
This page was built for publication:
