Labeling schemes for tree representation
type: Item
instance of: scholarly article
title: Labeling schemes for tree representation
zbMATH Open document ID: 1171.68599
author: Reuven Cohen
author: Pierre Fraigniaud
author: David Ilcinkas
author: Amos Korman
author: David Peleg
published in: Algorithmica
publication date: 2009-05-13T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5553466
zbMATH Keywords: labeling scheme
zbMATH Keywords: spanning tree
zbMATH Keywords: tree representation
MaRDI profile type: Publication
full work available at URL: s00453-007-9089-3
OpenAlex ID: W2010097739
cites work: Compact name-independent routing with minimum stretch
cites work: Q4398822
cites work: Q5567717
cites work: Automata, Languages and Programming
cites work: Distributed Computing – IWDC 2005
cites work: Q3619797
cites work: Q4828987
cites work: Optimum branchings
cites work: Universal codeword sets and representations of the integers
cites work: Q4535803
cites work: Q4763417
cites work: A Distributed Algorithm for Minimum-Weight Spanning Trees
cites work: A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
cites work: The Planar Hamiltonian Circuit Problem is NP-Complete
cites work: Implicat Representation of Graphs
cites work: Labeling Schemes for Flow and Connectivity
cites work: Proof labeling schemes
cites work: Fast Distributed Construction of Smallk-Dominating Sets and Applications
cites work: Distributed Computing: A Locality-Sensitive Approach
cites work: Compact oracles for reachability and approximate distances in planar digraphs
DOI: 10.1007/S00453-007-9089-3
description: scientific article; zbMATH DE number 5553466