Labeling schemes for tree representation
From MaRDI portal
Publication:1017912
DOI10.1007/s00453-007-9089-3zbMath1171.68599OpenAlexW2010097739MaRDI QIDQ1017912
Amos Korman, Pierre Fraigniaud, Reuven Cohen, David Ilcinkas, David Peleg
Publication date: 13 May 2009
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-007-9089-3
Related Items (3)
Graph decomposition for memoryless periodic exploration ⋮ Implicit representation of relations ⋮ Efficient distributed computation of distance sketches in networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- Implicat Representation of Graphs
- Universal codeword sets and representations of the integers
- The Planar Hamiltonian Circuit Problem is NP-Complete
- Fast Distributed Construction of Smallk-Dominating Sets and Applications
- A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
- Distributed Computing: A Locality-Sensitive Approach
- Labeling Schemes for Flow and Connectivity
- Compact name-independent routing with minimum stretch
- Proof labeling schemes
- Compact oracles for reachability and approximate distances in planar digraphs
- Distributed Computing – IWDC 2005
- Optimum branchings
- Automata, Languages and Programming
This page was built for publication: Labeling schemes for tree representation
