Labeling schemes for tree representation

Algorithmica (New York)

Volumn 53, Issue 1, 2009, Pages 1-15

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

^a Boston University   (United States)

^b CNRS   (France)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Labeling scheme; Spanning tree; Tree representation

Indexed keywords

ARBITRARY GRAPHS; COMPLETE GRAPHS; CONNECTED GRAPHS; LABELING SCHEME; NP-HARD; PLANAR GRAPHS; PORT NUMBERS; SOME APPLICATIONS; SPANNING TREE; TIGHT BOUNDS; TOTAL LENGTHS; TREE REPRESENTATION; WORST CASES;

GRAPH THEORY; LABELING; LABELS; PORTS AND HARBORS;

TREES (MATHEMATICS);

GRAPHIC METHODS; HARBORS; LABELING; LABELS; MATHEMATICAL ANALYSIS;

EID: 58149485779     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-007-9089-3     Document Type: Article

References (23)

1. Abraham, I., Gavoille, C., Malkhi, D., Nisan, N., Thorup, M.: Compact name-independent routing with minimum stretch. In: Proc. 16th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 20-24. ACM Press, New York (2004)
2. Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics. McGraw-Hill, New York (1998)
3. Y. Chu T. Liu 1965 On the shortest arborescence of a directed graph Sci. Sinica 14 1396 1400
4. Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A., Peleg, D.: Label-guided graph exploration by a finite automaton. In: Proc. 32nd Int. Colloq. on Automata, Languages & Prog. (ICALP). Lecture Notes of Computer Science, vol. 3580, pp. 335-346 (2005)
5. Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A., Peleg, D.: Labeling schemes for tree representation. In: Proceedings of 7th International Workshop on Distributed Computing (IWDC). Lecture Notes of Computer Science, vol. 3741, pp. 13-24 (2005)
6. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press/McGraw-Hill (1990)
7. Czumaj, A., Strothmann, W.-B.: Bounded-degree spanning tree. In: Proc. 5th European Symp. on Algorithms (ESA). Lecture Notes of Computer Science, vol. 1284, pp. 104-117 (1997)
8. Diks, K., Fraigniaud, P., Kranakis, E., Pelc, A.: Tree exploration with little memory. In: Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 588-597 (2002)
9. J. Edmonds 1967 Optimum branchings J. Res. Nat. Bur. Stand. 71B 233 240
10. P. Elias 1975 Universal codeword sets and representations of the integers IEEE Trans. Inf. Theory 21 2 194 203
11. Fraigniaud, P., Gavoille, C.: Routing in trees. In: Proc. 28th Int. Colloq. on Automata, Languages & Prog. (ICALP). Lecture Notes of Computer Science, vol. 2076, pp. 757-772 (July 2001)
12. Fürer, M., Raghavachari, B.: Approximating the minimum degree spanning tree within one from the optimal degree. In: Proc. 3rd ACM-SIAM Sump. on Discrete Algorithms (SODA), pp. 317-324 (1992)
13. R.G. Gallager P.A. Humblet P.M. Spira 1983 A distributed algorithm for minimum-weight spanning trees ACM Trans. Program. Lang. Syst. 5 1 66 77
14. J. Garay S. Kutten D. Peleg 1998 A sub-linear time distributed algorithm for minimum-weight spanning trees SIAM J. Comput. 27 302 316
15. M. Garey D. Johnson R. Tarjan 1976 The planar Hamiltonian circuit is NP-complete SIAM J. Comput. 5 4 704 714
16. P. Humblet 1983 A distributed algorithm for minimum weighted directed spanning trees IEEE Trans. Commun. 31 6 756 762
17. S. Kannan M. Naor S. Rudich 1992 Implicit representation of graphs SIAM J. Descrete Math. 5 596 603
18. M. Katz N.A. Katz A. Korman D. Peleg 2004 Labeling schemes for flow and connectivity SIAM J. Comput. 34 23 40
19. Korman, A., Kutten, S., Peleg, D.: Proof labeling schemes. In: Proc. the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), Las Vegas, NV, USA (2005)
20. S. Kutten 1998 Fast distributed construction of k-dominating sets and applications J. Algorithms 28 40 66
21. Lynch, N.: Distributed Algorithms. Morgan Kaufmann, Los Altos (1995)
22. Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM, Philadelphia (2000)
23. M. Thorup 2004 Compact oracles for reachability and approximate distances in planar digraphs J. ACM 51 993 1024