Abstract
In this paper we design a distance labeling scheme with \(\mathcal{O}(log n)\) bit labels for interval graphs and circular-arc graphs with n vertices. The set of all the labels is constructible in \(\mathcal{O}(n)\) time if the interval representation of the graph is given and sorted. As a byproduct we give a new and simpler \(\mathcal{O}(n)\) space data-structure computable after \(\mathcal{O}(n)\) preprocessing time, and supporting constant worst-case time distance queries for interval and circular-arc graphs. These optimal bounds improve the previous scheme of Katz, Katz, and Peleg (STACS ’00) by a log n factor. To the best of our knowledge, the interval graph family is the first hereditary family having 2Ω(nlogn) unlabeled n-vertex graphs and supporting a o(log2 n) bit distance labeling scheme.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abiteboul, S., Kaplan, H., Milo, T.: Compact labeling schemes for ancestor queries. In: 12th Symp. on Discrete Algorithms (SODA), pp. 547–556 (2001)
Alstrup, S., Bille, P., Rauhe, T.: Labeling schemes for small distances in trees. In: 15th Symp. on Discrete Algorithms, (SODA) (2003)
Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest common ancestors: A survey and a new distributed algorithm. In: 14th ACM Symp. on Parallel Algorithms and Architecture (SPAA), August 2002, pp. 258–264 (2002)
Alstrup, S., Rauhe, T.: Small induced-universal graphs and compact implicit graph representations. In: 43rd IEEE Symp. on Foundations of Computer Science (FOCS), pp. 53–62 (2002)
Berkman, O., Vishkin, U.: Finding level-ancestors in trees. J. of Computer and System Sciences 48, 214–230 (1994)
Chen, D.Z., Lee, D., Sridhar, R., Sekharan, C.N.: Solving the all-pair shortest path query problem on interval and circular-arc graphs. Networks 31, 249–257 (1998)
Cohen, J.E., Komlós, J., Mueller, T.: The probability of an interval graph, and why it matters. In: Proc. of Symposia in Pure Mathematics, vol. 34, pp. 97–115 (1979)
Corneil, D., Kim, H., Natarajan, S., Olariu, S., Sprague, A.: Simple linear time algorithm of unit interval graphs. Info. Proces. Letters 55, 99–104 (1995)
Courcelle, B., Vanicat, R.: Query efficient implementation of graphs of bounded clique width. Discrete Applied Mathematics (2001) (to appear)
de Figueiredo Herrera, C., Meidanis, J., de Mello, C.P.: A lineartime algorithm for proper interval recognition. Information Processing Letters 56, 179–184 (1995)
Gavoille, C.: Routing in distributed networks: Overview and open problems. ACM SIGACT News - Distributed Computing Column 32, 36–52 (2001)
Gavoille, C., Katz, M., Katz, N.A., Paul, C., Peleg, D.: Approximate distance labeling schemes. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 476–488. Springer, Heidelberg (2001)
Gavoille, C., Paul, C.: Distance labeling scheme and split decomposition. Discrete Mathematics (2003) (to appear)
Gavoille, C., Peleg, D.: Compact and localized distributed data structures, Research Report RR-1261-01, LaBRI, University of Bordeaux (August 2001); To appear in J. of Distributed Computing for the PODC 20-Year Special Issue
Gavoille, C., Peleg, D., Pérennes, S., Raz, R.: Distance labeling in graphs. In: 12th Symp. on Discrete Algorithms (SODA), pp. 210–219 (2001)
Hanlon, P.: Counting interval graphs. Transactions of the American Mathematical Society 272, 383–426 (1982)
Hell, P., Bang-Jensen, J., Huang, J.: Local tournaments and proper circular arc graphs. In: Asano, T., Imai, H., Ibaraki, T., Nishizeki, T. (eds.) SIGAL 1990. LNCS, vol. 450, pp. 101–108. Springer, Heidelberg (1990)
Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. SIAM J. on Discrete Mathematics 5, 596–603 (1992)
Kaplan, H., Milo, T., Shabo, R.: A comparison of labeling schemes for ancestor queries. In: 14th Symp. on Discrete Algorithms (SODA) (2002)
Katz, M., Katz, N.A., Korman, A., Peleg, D.: Labeling schemes for flow and connectivity. In: 13th Symp. on Discrete Algorithms (SODA), pp. 927–936 (2002)
Katz, M., Katz, N.A., Peleg, D.: Distance labeling schemes for wellseparated graph classes. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 516–528. Springer, Heidelberg (2000)
Korman, A., Peleg, D., Rodeh, Y.: Labeling schemes for dynamic tree networks. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 76–87. Springer, Heidelberg (2002)
McConnell, R.M.: Linear-time recognition of circular-arc graphs. In: 42th IEEE Symp. on Foundations of Computer Science (FOCS) (2001)
Peleg, D.: Informative labeling schemes for graphs. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 579–588. Springer, Heidelberg (2000)
Peleg, D.: Proximity-preserving labeling schemes. J. of Graph Theory 33 (2000)
Roberts, F.: Indifference graphs. In: Proof Techniques in Graph Theory, pp. 139–146. Academic Press, London (1969)
Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. In: 42th IEEE Symp. on Foundations of Computer Science (FOCS) (2001)
Thorup, M., Zwick, U.: Approximate distance oracles. In: 33rd ACM Symp. on Theory of Computing (STOC), pp. 183–192 (2001)
Thorup, M., Zwick, U.: Compact routing schemes. In: 13th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp. 1–10 (2001)
Wegner, G.: Eigenschaften der Neuen homologish-einfacher Familien im Rn, PhD thesis, University of Göttingen (1967)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gavoille, C., Paul, C. (2003). Optimal Distance Labeling for Interval and Circular-Arc Graphs. In: Di Battista, G., Zwick, U. (eds) Algorithms - ESA 2003. ESA 2003. Lecture Notes in Computer Science, vol 2832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39658-1_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-39658-1_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20064-2
Online ISBN: 978-3-540-39658-1
eBook Packages: Springer Book Archive