Abstract
As defined by Muller (Muller, Ph.D. thesis, Georgia Tech, 1988) and Kannan, Naor, and Rudich (Kannan et al., SIAM J Disc Math, 1992), an adjacency labelling scheme labels the vertices of a graph so the adjacency of two vertices can be deduced implicitly from their labels. In general, the labels used in adjacency labelling schemes cannot be tweaked to reflect small changes in the graph.
Motivated by the necessity for further exploration of dynamic (implicit) adjacency labelling schemes we introduce the concept of error detection, discuss metrics for judging the quality of such dynamic schemes, and develop a dynamic scheme for line graphs that allows the addition and deletion of vertices and edges. The labels used in this scheme require O(log n) bits and updates can be performed in O(e) time, where e is the number of edges added to or deleted from the line graph. This compares to the best known (static) adjacency labelling scheme for line graphs which uses O(log n) bit labels and requires Θ(n) time to generate a labelling even when provided with the line graph representation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Muller, J.H.: Local structure in graph classes. PhD thesis, Georgia Institute of Technology (1988)
Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. SIAM J. on Discrete Mathematics 5, 596–603 (1992)
Gavoille, C., Peleg, D.: Compact and localized distributed data structures. J. of Distributed Computing 16, 111–120 (2003)
Peleg, D.: Informative labeling schemes for graphs. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 579–588. Springer, Heidelberg (2000)
Gavoille, C., Paul, C.: Optimal distance labeling for interval and circular-arc graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 254–265. Springer, Heidelberg (2003)
Peleg, D.: Proximity-preserving labeling schemes and their applications. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol. 1665, pp. 30–41. Springer, Heidelberg (1999)
Kaplan, H., Milo, T.: Short and simple labels for small distances and other functions. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol. 2125, pp. 246–257. Springer, Heidelberg (2001)
Abiteboul, S., Kaplan, H., Milo, T.: Compact labeling schemes for ancestor queries. In: Proc. 12t h ACM-SIAM Symp. on Discrete Algorithms, pp. 547–556. ACM, New York (2001)
Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest common ancestors: A survey and a new distributed algorithm. In: Proc. 14th ACM Symp. on Parallel Algorithms and Architectures, pp. 258–264. ACM, New York (2002)
Thorup, M., Zwick, U.: Compact routing schemes. In: Proc. 13th ACM Symp. on Parallel Algorithms and Architectures, pp. 1–10. ACM, New York (2001)
Brodal, G.S., Fagerberg, R.: Dynamic representation of sparse graphs. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 342–351. Springer, Heidelberg (1999)
Korman, A., Peleg, D.: Labelling schemes for weighted dynamic trees. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 369–383. Springer, Heidelberg (2003)
Korman, A., Peleg, D., Rodeh, Y.: Labeling schemes for dynamic tree networks. Theory of Computing Systems 37, 49–75 (2004)
Cohen, E., Kaplan, H., Milo, T.: Labeling dynamic XML trees. In: Proc. 21st ACM Symp. on Principles of Database Systems, pp. 271–281 (2002)
Branstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. In: SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (1999)
Whitney, H.: Congruent graphs and the connectivity of graphs. American J. of Mathematics 54, 150–168 (1932)
Lehot, P.G.H.: An optimal algorithm to detect a line graph and output its root graph. J. of the ACM 21, 569–575 (1974)
Roussopoulos, N.D.: A max{m, n} algorithm for determining the graph H from its line graph G. Information Processing Letters 2, 108–112 (1973)
Spinrad, J.: Efficient Graph Representation. In: Fields Institute Monographs. AMS, Providence (2003)
Morgan, D.: Useful names for vertices: An introduction to dynamic implicit informative labelling schemes. Technical Report TR05-04, Dept. of Computing Science, University of Alberta (2005)
Morgan, D.: A dynamic implicit adjacency labelling scheme for line graphs. Technical Report TR05-03, Dept. of Computing Science, University of Alberta (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morgan, D. (2005). A Dynamic Implicit Adjacency Labelling Scheme for Line Graphs. In: Dehne, F., López-Ortiz, A., Sack, JR. (eds) Algorithms and Data Structures. WADS 2005. Lecture Notes in Computer Science, vol 3608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534273_26
Download citation
DOI: https://doi.org/10.1007/11534273_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28101-6
Online ISBN: 978-3-540-31711-1
eBook Packages: Computer ScienceComputer Science (R0)