Distributed Computing – IWDC 2005

DOI10.1007/11603771zbMath1170.05303OpenAlexW2483758159MaRDI QIDQ5491762

Pierre Fraigniaud, Reuven Cohen, David Ilcinkas, Amos Korman, David Peleg

Publication date: 10 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (5)

Proof labeling schemes ⋮ Distributed computing with advice: information sensitivity of graph coloring ⋮ Local MST computation with short advice ⋮ Communication algorithms with advice ⋮ Labeling schemes for tree representation

This page was built for publication: Distributed Computing – IWDC 2005