Constructing labeling schemes through universal matrices

Algorithmica (New York)

Volumn 57, Issue 4, 2010, Pages 641-652

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

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c TEL HAI COLLEGE   (Israel)

Author keywords

Adjacency; Distance; Labeling schemes; Universal matrices

Indexed keywords

ADJACENCY LABELING; CONNECTED GRAPH; DISTANCE LABELING; GRAPH G; LABELING SCHEME; LOWER BOUNDS; NODE GRAPH; NON-TRIVIAL; UPPER BOUND;

LABELS;

GRAPHIC METHODS;

EID: 77952095406     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-008-9226-7     Document Type: Article

References (33)

1. Alstrup, S. Bille, P. Rauhe, T.: Labeling schemes for small distances in trees. In: Proc. 14th ACM-SIAM Symp. on Discrete Algorithms (2003)
2. S. Alstrup C. Gavoille H. Kaplan T. Rauhe 2004 Nearest common ancestors: A survey and a new distributed algorithm Theory Comput. Syst. 37 441 456 1093.68136 10.1007/s00224-004-1155-5 2065826 (Pubitemid 39439490)
3. Abiteboul, S. Kaplan, H. Milo, T.: Compact labeling schemes for ancestor queries. In: Proc. 12th ACM-SIAM Symp. on Discrete Algorithms (2001) (Pubitemid 44935680)
4. Alstrup, S. Rauhe, T.: Improved labeling scheme for ancestor queries. In: Proc. 19th ACM-SIAM Symp. on Discrete Algorithms (2002) (Pubitemid 44935680)
5. Alstrup, S. Rauhe, T.: Small induced-universal graphs and compact implicit graph representations. In: Proc. 43rd IEEE Symp. on Foundations of Computer Science (2002)
6. F.R.K. Chung 1990 Universal graphs and induced-universal graphs J. Graph. Theory 14 4 443 454 0707.05036 10.1002/jgt.3190140408 1067239
7. Cohen, E. Halperin, E. Kaplan, H. Zwick, U.: Reachability and distance queries via 2-hop labels. In: Proc. 13th ACM-SIAM Symp. on Discrete Algorithms (2002)
8. Cohen, E. Kaplan, H. Milo, T.: Labeling dynamic XML trees. In: Proc. 21st ACM Symp. on Principles of Database Systems (2002) (Pubitemid 35009500)
9. Fraigniaud, P. Gavoille, C.: Routing in trees. In: Proc. 28th Int. Colloq. on Automata, Languages & Prog. LNCS, vol. 2076, pp. 757-772. Springer, Berlin (2001) (Pubitemid 33300845)
10. Gavoille, C. Paul, C.: Split decomposition and distance labelling: an optimal scheme for distance hereditary graphs. In: Proc. European Conf. on Combinatorics, Graph Theory and Applications (2001)
11. C. Gavoille D. Peleg 2003 Compact and localized distributed data structures Distrib. Comput. 16 111 120 10.1007/s00446-002-0073-5
12. Gavoille, C. Katz, M. Katz, N.A. Paul, C. Peleg, D.: Approximate distance labeling schemes. In: Proc. 9th European Symp. on Algorithms, pp. 476-488 (2001) (Pubitemid 33328982)
13. Gavoille, C. Peleg, D. Pérennes, S. Raz, R.: Distance labeling in graphs. In: Proc. 12th ACM-SIAM Symp. on Discrete Algorithms, pp. 210-219 (2001)
14. Korman, A.: General compact labeling schemes for dynamic trees. In: Proc. 19th Symp. on Distributed Computing (2005)
15. Korman, A. Kutten, S.: Distributed verification of minimum spanning trees. In: 25th ACM Symp. on Principles of Distributed Computing (2006) (Pubitemid 44393690)
16. S. Kannan M. Naor S. Rudich 1992 Implicit representation of graphs SIAM J. Discrete Math. 5 596 603 0768.05082 10.1137/0405049 1186827
17. Kaplan, H. Milo, T.: Short and simple labels for small distances and other functions. In: Workshop on Algorithms and Data Structures (2001) (Pubitemid 33315651)
18. Kaplan, H. Milo, T.: Parent and ancestor queries using a compact index. In: Proc. 20th ACM Symp. on Principles of Database Systems (2001)
19. Kaplan, H. Milo, T. Shabo, R.: A comparison of labeling schemes for ancestor queries. In: Proc. 19th ACM-SIAM Symp. on Discrete Algorithms (2002)
20. Katz, M. Katz, N.A. Korman, A. Peleg, D.: Labeling schemes for flow and connectivity. In: Proc. 19th ACM-SIAM Symp. on Discrete Algorithms (2002) (Pubitemid 40449914)
21. Katz, M. Katz, N.A. Peleg, D.: Distance labeling schemes for well-separated graph classes. In: Proc. 17th Symp. on Theoretical Aspects of Computer Science, pp. 516-528 (2000)
22. Korman, A. Peleg, D.: Labeling schemes for weighted dynamic trees. In: Proc. 30th Int. Colloq. on Automata, Languages & Prog. (2003) (Pubitemid 36905086)
23. Korman, A. Peleg, D.: Compact separator decompositions in dynamic trees and applications to labeling schemes. In: Proc. 21st Symp. on Distributed Computing. SV-LNCS, vol. 4731, pp. 313-327. Springer, Berlin (2007)
24. A. Korman D. Peleg Y. Rodeh 2004 Labeling schemes for dynamic tree networks Theory Comput. Syst. 37 49 75 1101.68334 10.1007/s00224-003-1106-6 2038402 (Pubitemid 38259808)
25. V.V. Lozin 1997 On minimal universal graphs for hereditary classes J. Discrete Math. Appl. 7 3 295 304 0965.05061 10.1515/dma.1997.7.3.295 1468076
26. Lozin, V.V. Rudolf, G.: Minimal universal bipartite graphs. Ars Comb. 84 (2007)
27. J.W. Moon 1965 On minimal n-universal graphs Proc. Glasgow Math. Soc. 7 32 33 0132.21202 10.1017/S2040618500035139
28. Peleg, D.: Proximity-preserving labeling schemes and their applications. In: Proc. 25th Int. Workshop on Graph-Theoretic Concepts in Computer Science, pp. 30-41, June 1999
29. D. Peleg 2005 Informative labeling schemes for graphs Theor. Comput. Sci. 340 577 593 1077.68078 10.1016/j.tcs.2005.03.015 2160465 (Pubitemid 41162160)
30. Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM, Philadelphia (2000)
31. Rado, R.: Universal graphs and universal functions. Acta Arith. 331-340 (1964)
32. M. Thorup 2004 Compact oracles for reachability and approximate distances in planar digraphs J. ACM 51 993 1024 1125.68394 10.1145/1039488.1039493 2145261 (Pubitemid 40818313)
33. Thorup, M. Zwick, U.: Compact routing schemes. In: Proc. 13th ACM Symp. on Parallel Algorithms and Architecture, Hersonissos, Crete, pp. 1-10 (2001) (Pubitemid 32865386)