Labeling Schemes for Dynamic Tree Networks

Theory of Computing Systems

Volumn 37, Issue 1, 2004, Pages 49-75

  Korman, Amos ^a   Peleg, David ^a   Rodeh, Yoav ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

AMORTIZED MESSAGE COMPLEXITY; DISTRIBUTED LABELING SCHEMES; DYNAMIC TREE NETWORKS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECODING; DISTRIBUTED PARAMETER CONTROL SYSTEMS; INFORMATION THEORY; LABELING; MATHEMATICAL MODELS; NETWORK PROTOCOLS; THEOREM PROVING;

TREES (MATHEMATICS);

EID: 1342333624     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-003-1106-6     Document Type: Conference Paper

References (25)

1. [AAPS] Y. Afek, B. Awerbuch, S.A. Plotkin, and M. Saks. Local management of a global resource in a communication. Journal of the ACM, 43:1-19, 1996.
2. [AGKR] S. Alstrup, C. Gavoille, H. Kaplan, and T. Rauhe. Identifying Nearest Common Ancestors in a Distributed Environment. IT-C Technical Report 2001 -6, The IT University, Copenhagen, Denmark, Aug. 2001.
3. [AKM] S. Abiteboul, H. Kaplan, and T. Milo. Compact labeling schemes for ancestor queries. In Proc. 12th ACM-SIAM Symp. on Discrete Algorithms, pages 547-556, Jan. 2001.
4. [AR] S. Alstrup and T. Rauhe. Improved labeling scheme for ancestor queries. In Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, pages 947-953, Jan. 2002.
5. [B] M.A. Breuer. Coding the vertexes of a graph. IEEE Transactions on Information Theory, IT-12:148-153, 1966.
6. [BF] M.A. Breuer and J. Folknian. An unexpected result on coding the vertices of a graph. Journal of Mathematical Analysis and Applications, 20:583-600, 1967.
7. [CHKZ] E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. In Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, pages 937-946, Jan. 2002.
8. [FG1] P. Fraigniaud and C. Gavoille. Routing in trees. In Proc. 28th Internat. Colloq. on Automata, Languages & Programming, LNCS 2076, Springer-Verlag, Berlin, pages 757-772, July 2001.
9. [FG2] P. Fraigniaud and C. Gavoille. A space lower bound for routing in trees. In Proc. 19th Symp. on Theoretical Aspects of Computer Science, pages 65-75, Mar. 2002.
10. [GKK+] C. Gavoille, M. Katz, N.A. Katz, C. Paul, and D. Peleg. Approximate distance labeling schemes. In Proc. 9th European Symp. on Algorithms, Aarhus, Denmark, LNCS 2161, Springer-Verlag, Berlin, pages 476-488, Aug. 2001.
11. [GP1] C. Gavoille and C. Paul. Split decomposition and distance labelling: an optimal scheme for distance hereditary graphs. In Proc. European Conf. on Combinatorics, Graph Theory and Applications, Sept. 2001.
12. [GP2] C. Gavoille and D. Peleg. Compact and Localized Distributed Data Structures. Research Report RR-1261-01, LaBRI, University of Bordeaux, France, Aug. 2001.
13. [GPPR] C. Gavoille, D. Peleg, S. Pérennes, and R. Raz. Distance labeling in graphs. In Proc. 12th ACM-SIAM Symp. on Discrete Algorithms, pages 210-219, Jan. 2001.
14. [KKKP] M. Katz, N.A. Katz, A. Korman, and D. Peleg. Labeling schemes for flow and connectivity. In Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, pages 927-936, Jan. 2002.
15. [KKP] M. Katz, N.A. Katz, and D. Peleg. Distance labeling schemes for well-separated graph classes. In Proc. 17th Symp. on Theoretical Aspects of Computer Science, pages 516-528, Feb. 2000.
16. [KM] H. Kaplan and T. Milo. Short and simple labels for small distances and other functions. In Proc. Workshop on Algorithms and Data Structures, pages 246-257, Aug. 2001.
17. [KMS] H. Kaplan, T. Milo, and R. Shabo. A comparison of labeling schemes for ancestor queries. In Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, pages 954-963, Jan. 2002.
18. [KNR] S. Kannan, M. Naor, and S. Rudich. Implicit representation of graphs. In Proc. 20th ACM Symp. on Theory of Computing, pages 334-343, May 1988.
19. [KP] A. Korman and D. Peleg. Labeling schemes for weighted dynamic trees. In Proc. 30th Internat. Colloq. on Automata, Languages & Programming, Eindhoven, The Netherlands, LNCS 2719, Springer-Verlag, Berlin, pages 369-383, July 2003.
20. [P1] D. Peleg. Proximity-preserving labeling schemes and their applications. In Proc. 25th Internat. Workshop on Graph-Theoretic Concepts in Computer Science, pages 30-41, June 1999.
21. [P2] D. Peleg. Informative labeling schemes for graphs. In Proc. 25th Symp. on Mathematical Foundations of Computer Science, LNCS 1893, Springer-Verlag, Berlin, pages 579-588, Aug. 2000.
22. [P3] D. Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM, Philadelphia, PA, 2000.
23. [SK] N. Santoro and R. Khatib. Labelling and implicit routing in networks. The Computer Journal, 28:5-8, 1985.
24. [T] M. Thorup. Compact oracles for reachability and approximate distances in planar digraphs. In Proc. 42nd IEEE Symp. on Foundations of Computer Science, pages 242-251, Oct. 2001.
25. [TZ] M. Thorup and U. Zwick. Compact routing schemes. In Proc. 13th ACM Symp. on Parallel Algorithms and Architecture, Hersonissos, Crete, Greece, pages 1-10, July 2001.