Abstract
In this paper, the space requirements for the OBDD representation of certain graph classes, specifically cographs, several types of graphs with few P 4s, unit interval graphs, interval graphs and bipartite graphs are investigated. Upper and lower bounds are proven for all these graph classes and it is shown that in most (but not all) cases a representation of the graphs by OBDDs is advantageous with respect to space requirements.
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
Andreev, A., Baskakov, J., Clementi, A., Rolim, J.: Small pseudo-random sets yield hard functions: New tight explicit lower bounds for branching programs. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 179–189. Springer, Heidelberg (1999)
Breitbart, Y., Hunt III, H., Rosenkrantz, D.: On the size of binary decision diagrams representing boolean functions. Theor. Comp. Sci. 145, 45–69 (1995)
Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. C-35, 677–691 (1986)
Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement reducible graphs. Discrete Appl. Math. 3, 163–174 (1981)
Finch, S.R.: Mathematical Constants. Cambridge University Press, Cambridge (2003)
Finch, S.R.: Series-parallel networks (2003); Supplementary Material for [15]
Gavoille, C., Paul, C.: Optimal distance labeling schemes for interval and circular-arc graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 254–265. Springer, Heidelberg (2003)
Hachtel, G.D., Somenzi, F.: A symbolic algorithm for maximum flow in 0-1 networks. Formal Methods in System Design 10, 207–219 (1997)
Jamison, B., Olariu, S.: p 4-reducible graphs - a class of uniquely tree representable graphs. Stud. Appl. Math. 81, 79–87 (1989)
Jamison, B., Olariu, S.: On a unique tree representation for p 4-extendible graphs. Discrete Appl. Math. 34, 151–164 (1991)
Jamison, B., Olariu, S.: A tree representation for p 4-sparse graphs. Discrete Appl. Math. 35, 115–129 (1992)
Prömel, H.J.: Counting unlabeled structures. J. Combin. Theory Ser. A 44, 83–93 (1987)
Prömel, H.J., Steger, A.: Random l-colorable graphs. Random Structures Algorithms 6, 21–37 (1995)
Read, R.C., Wright, E.M.: Coloured graphs: A correction and extension. Canad. J. Math. 22, 594–596 (1970)
Sawitzki, D.: Implicit flow maximization by iterative squaring. In: Van Emde Boas, P., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2004. LNCS, vol. 2932, pp. 301–313. Springer, Heidelberg (2004)
Sawitzki, D.: A symbolic approach to the all-pairs shortest-paths problem. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 154–167. Springer, Heidelberg (2004)
Sieling, D., Wegener, I.: NC-algorithms for operations on binary decision diagrams. Parallel Processing Letters 3, 3–12 (1993)
Wegener, I.: Branching Programs and Binary Decision Diagrams. SIAM, Philadelphia (2000)
Woelfel, P.: Symbolic topological sorting with OBDDs. Journal of Discrete Algorithms (to appear)
Wright, E.M.: Counting coloured graphs. Canad. J. Math. 13, 683–693 (1961)
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
Nunkesser, R., Woelfel, P. (2005). Representation of Graphs by OBDDs. In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_112
Download citation
DOI: https://doi.org/10.1007/11602613_112
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30935-2
Online ISBN: 978-3-540-32426-3
eBook Packages: Computer ScienceComputer Science (R0)