Abstract
How to represent a graph in memory is a fundamental data structuring problem. In the usual representations, a graph is stored by representing explicitly all vertices and all edges. The names (labels) assigned to vertices are used only to encode the edges and betray nothing about the structure of the graph itself and hence are a “waste” of space. In this context, we present a general framework for labeling any graph so that adjacency between any two given vertices can be tested in constant time. The labeling schema assigns to each vertex x of a general graph a O(δ(x)log3 n) bit label, where n is the number of vertices and δ(x) is x’s degree. The adjacency test can be performed in 5 steps and the schema can be computed in polynomial time. This representation strictly contrasts with usual representations, i.e. adjacency matrix and adjacency list representations, which require O(nlog n) bit label per vertex and constant time adjacency test, and O(δ(x)log n) bit label per vertex and O(logδ (x)) steps to test adjacency, respectively. Additionally, the labeling schema is implicit, that is: no pointers are used.
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
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)
Breuer, M.: Coding vertices of a graph. IEEE Trans. Infor. Theory 12, 148–153 (1966)
Breuer, M., Folkman, J.: An unexpected result on coding vertices. J. Math. Anal. Appl. 20, 583–600 (1967)
Frederickson, G.N.: Implicit data structures for the dictionary problem. J. of the ACM 30(1), 80–94 (1980)
Frederickson, G.N., Janardan, R.: Optimal message routing without complete routing tables. In: Proc. 5th Annual ACM Symposium on Principles of Distributed Computing, Calgary, August 1986, pp. 88–97 (1986)
Frederickson, G.N., Janardan, R.: Designing networks with compact routing tables. Algorithmica 3, 171–190 (1988)
Frederickson, G.N., Janardan, R.: Efficient message routing in planar networks. SIAM Journal on Computing 18, 843–857 (1989)
Frederickson, G.N., Janardan, R.: Space efficient message routing in c-decomposable networks. SIAM Journal on Computing 19, 164–181 (1990)
Gambosi, G., Vocca, P.: Topological Routing. In: Babaoğlu, Ö., Marzullo, K. (eds.) WDAG 1996. LNCS, vol. 1151, pp. 206–219. Springer, Heidelberg (1996)
Harary, F.: Graph Theory. Addison-Wesley, Reading (1972)
Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. SIAM Journal of Discrete Mathematics 5(4), 596–603 (1992)
lan Munro, J.: An implicit data structure supporting inserting, deletion, and search in o(log2 n) time. J. of Comp. and Syst. Science 33, 66–74 (1986)
lan Munro, J., Suwanda., H.: Implicit data structures for fast search and update. J. of Comp. and Syst. Science 21, 236–250 (1980)
Naor, M., Stockmeyer, L.: What can be computed locally? SIAM J.Comput. 24(6), 1259–1277 (1995)
Ouksel, M., Scheurmann, P.: Implicit data structure for linear hashing schemes. Inf. Proc. Letters 29, 183–189 (1988)
Santoro, N., Khatib, R.: Labelling and implicit routing in networks. Computer Journal 28(1), 5–8 (1985)
Talamo, M., Vocca, P.: A time optimal digraph browsing on a sparse representation. Technical Report 8, Math Department, University of Rome "Tor Vergata", Submitted to JGAA (1997)
Turan, G.: Succint representation of graphs. Discrete Appl. Math. 8, 289–284 (1984)
van Leeuwen, J. (ed.): Graph algorithms. Handbook of Theoretical Computer Science, vol. A, pp. 525–631. Elsevier Science Publisher B.V., Amsterdam (1990)
van Leeuwen, J., Tan, R.B.: Computer networks with compact routing tables. In: Rozenberg, G., Salomaa, A. (eds.) The Book of L, vol. 790. Springer, Heidelberg (1986)
van Leeuwen, J., Tan, R.B.: Interval routing. Computer Journal 30, 298–307 (1987)
van Leeuwen, J., Tan, R.B.: Compact routing methods: A survey. In: Proc. Colloquium on Structural Information and Communication Complexity (SICC 1994). Carleton University Press, Ottawa (1994)
Vitter, J.S., Shriver, E.A.M.: Algorithms for parallel memory, i: Two-level memories. Algorithmica 12(6), 110–147 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Talamo, M., Vocca, P. (1998). Compact Implicit Representation of Graphs. In: Hromkovič, J., Sýkora, O. (eds) Graph-Theoretic Concepts in Computer Science. WG 1998. Lecture Notes in Computer Science, vol 1517. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10692760_14
Download citation
DOI: https://doi.org/10.1007/10692760_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65195-6
Online ISBN: 978-3-540-49494-2
eBook Packages: Springer Book Archive