Labeling schemes for tree representation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3741 LNCS, Issue , 2005, Pages 13-24

  Cohen, Reuven ^a   Fraigniaud, Pierre ^b   Ilcinkas, David ^b   Korman, Amos ^a   Peleg, David ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; KNOWLEDGE REPRESENTATION; MATHEMATICAL MODELS; POLYNOMIALS; RANDOM NUMBER GENERATION;

ARBITRARY GRAPHS; LABEL-BASED REPRESENTATIONS; SPANNING TREE; TREE EDGES;

TREES (MATHEMATICS);

EID: 33745303453     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11603771_2     Document Type: Conference Paper

References (12)

1. H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Tbpics. McGraw-Hill, 1998.
2. Y. Chu and T. Liu. On the shortest arborescence of a directed graph. Science Sinica 14, pages 1396-1400, 1965.
3. R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman and D. Peleg. Label-Guided Graph Exploration by a Finite Automaton. In Proc. 32nd Int. Colloq. on Automata, Languages & Prog. (ICALP), LNCS 3580, pages 335-346, 2005.
4. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. MIT Press/McGraw-Hill, 1990.
5. A. Czumaj and W.-B. Strothmann. Bounded-degree spanning tree. In Proc. 5th European Symp. on Algorithms (ESA), LNCS 1284, pages 104-117, 1997.
6. K. Diks, P. Fraigniaud, E. Kranakis, and A. Pelc. Tree Exploration with Little Memory. In Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 588-597, 2002.
7. J. Edmonds. Optimum branchings. J. Research of the National Bureau of Standards 71B, pages 233-240, 1967.
8. P. Elias. Universal Codeword Sets and Representations of the Integers. IEEE Trans. Inform. Theory 21(2): 194-203, 1975.
9. M. Fürer and B. Raghavachari. Approximating the minimum degree spanning tree within one from the optimal degree. In Proc. 3rd Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 317-324, 1992.
10. M. Garey, D. Johnson, and R. Tarjan. The planar Hamiltonian circuit is NP-complete. SIAM Journal on Computing 5(4):704-714, 1976.
11. N. Lynch. Distributed Algorithms. Morgan Kaufmann, 1995.
12. D. Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM, 2000.