scientific article
From MaRDI portal
Publication:2768347
zbMath1012.90046MaRDI QIDQ2768347
Tova Milo, Haim Kaplan, Serge Abiteboul
Publication date: 30 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (21)
A Simple and Optimal Ancestry Labeling Scheme for Trees ⋮ Byzantine gathering in polynomial time ⋮ Compact separator decompositions in dynamic trees and applications to labeling schemes ⋮ Finding the size and the diameter of a radio network using short labels ⋮ Near-optimal induced universal graphs for cycles and paths ⋮ Four shades of deterministic leader election in anonymous networks ⋮ Fast rendezvous with advice ⋮ Unnamed Item ⋮ Lower and upper bounds for deterministic convergecast with labeling schemes ⋮ General compact labeling schemes for dynamic trees ⋮ Distributed Relationship Schemes for Trees ⋮ Labeling schemes for weighted dynamic trees ⋮ Impact of knowledge on election time in anonymous networks ⋮ Trade-offs between the size of advice and broadcasting time in trees ⋮ Communication algorithms with advice ⋮ Constructing labeling schemes through universal matrices ⋮ XRules: an effective algorithm for structural classification of XML data ⋮ Short labeling schemes for topology recognition in wireless tree networks ⋮ Advice complexity of treasure hunt in geometric terrains ⋮ Short Labels by Traversal and Jumping ⋮ Topology recognition with advice
This page was built for publication:
