Compact separator decompositions in dynamic trees and applications to labeling schemes

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

Volumn 4731 LNCS, Issue , 2007, Pages 313-327

  Korman, Amos ^a   Peleg, David ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Distributed algorithms; Dynamic networks; Graph decompositions; Informative labeling schemes; Routing schemes

Indexed keywords

COMPUTATIONAL COMPLEXITY; MESSAGE PASSING; NETWORK ROUTING; PARALLEL ALGORITHMS; TOPOLOGY;

DYNAMIC NETWORKS; DYNAMIC TREES; GRAPH DECOMPOSITIONS; ROUTING SCHEMES;

TREES (MATHEMATICS);

EID: 38049048318     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75142-7_25     Document Type: Conference Paper

References (24)

1. Abiteboul, S., Alstrup, S., Kaplan, H., Milo, T., Rauhe, T.: Compact Labeling Scheme for Ancestor Queries. SIAM J. Computing 35(6), 1295-1309 (2006)
2. Abiteboul, S., Kaplan, H., Milo, T.: Compact Labeling Schemes for Ancestor Queries. In: Proc. 12th ACM-SIAM Symp. on Discrete Algorithms. ACM Press, New York (2001)
3. Afek, Y., Awerbuch, B., Plotkin, S.A., Saks, M.: Local Management of a Global Resource in a Communication. J. ACM 43, 1-19 (1996)
4. Afek, Y., Gafni, E., Ricklin, M.: Upper and Lower Bounds for Routing Schemes in Dynamic Networks. In: Proc. 30th Symp. on Foundations of Computer Science, pp. 370-375 (1989)
5. Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest Common Ancestors: A Survey and a new Distributed Algorithm. Theory of Computing Systems 37, 441-456 (2004)
6. Alstrup, S., Rauhe, T.: Small induced-universal graphs and compact implicit graph representations. In: Proc. 43'rd IEEE Symp. on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos (2002)
7. Cole, R., Hariharan, R.: Dynamic LCA Queries on Trees. SIAM J. Computing 34(4), 894-923 (2005)
8. Eppstein, D., Galil, Z., Italiano, G.F.: Dynamic Graph Algorithms. In: Atallah, M.J. (ed.) Algorithms and Theoretical Computing Handbook, ch. 8. CRC Press, Boca Raton, USA (1999)
9. Fraigniaud, P., Gavoille, C.: Routing in Trees. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 757-772. Springer, Heidelberg (2001)
10. Fraigniaud, P., Gavoille, C.: A space lower bound for routing in trees. In: Proc. 19th Int. Symp. on Theoretical Aspects of Computer Science, pp. 65-75 (March 2002)
11. Feigenbaum, J., Kannan, S.: Dynamic Graph Algorithms. In: Handbook of Discrete and Combinatorial Mathematics. CRC Press, Boca Raton, USA (2000)
12. Gavoille, C., Katz, M., Katz, N.A., Paul, C., Peleg, D.: Approximate Distance Labeling Schemes. In: 9th European Symp. on Algorithms, pp. 476-488 (August 2001)
13. Kannan, S., Naor, M., Rudich, S.: Implicit Representation of Graphs. SIAM J. on Descrete Math. 5, 596-603 (1992)
14. Korman, A.: General Compact Labeling Schemes for Dynamic Trees. In: Proc. 19th Symp. on Distributed Computing (September 2005)
15. Korman, A.: Labeling Schemes for Vertex Connectivity. In: Proc. 34th Int. Colloq. on Automata, Languages and Prog (ICALP) (July 2007)
16. Korman, A., Kutten, S.: Controller and Estimator for Dynamic Networks. In: Proc. 26th ACM Symp. on Principles of Distributed Computing. ACM Press, New York (2007)
17. Korman, A., Peleg, D.: Labeling Schemes for Weighted Dynamic Trees. In: Proc. 30th Int. Colloq. on Automata, Languages & Prog. (July 2003)
18. Korman, A., Peleg, D., Rodeh, Y.: Labeling Schemes for Dynamic Tree Networks. STACS 2002 37(1), 49-75 (2004) Special Issue of STACS'02 papers.
19. Peleg, D.: Informative Labeling Schemes for Graphs. Theoretical Computer Science 340, 577-593 (2005) Special Issue of MFCS'OO papers
20. Peterson, L.L., Davie, B.S.: Computer Networks: A Systems Approach. Morgan Kaufmann, San Francisco (2007)
21. Schieber, B., Vishkin, U.: On finding Lowest Common Ancestors: Simplification and Parallelization. SIAM J. Computing 17(6), 1253-1262 (1988)
22. Sleator, D.D., Tarjan, R.E.: A Data Structure for Dynamic Trees. J. Computer & System Sciences 26(1), 362-391 (1983)
23. Tanenbaum, A.S.: Computer Networks. Prentice-Hall, Englewood Cliffs (2003)
24. Thorup, M., Zwick, U.: Compact Routing Schemes. In: Proc. 13th ACM Symp. on Parallel Algorithms and Architecture, pp. 1-10. ACM Press, New York (2001)