Skip to main content
SpringerLink
Log in

On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem

  • Conference paper
Combinatorial Optimization and Applications (COCOA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6509))

Abstract

The minimum spanning tree problem is one of the most fundamental algorithmic graph problems and OBDDs are a very common dynamic data structure for Boolean functions. Since in some applications graphs become larger and larger, a research branch has emerged which is concerned with the design and analysis of so-called symbolic algorithms for classical graph problems on OBDD-represented graph instances. Here, a symbolic minimum spanning tree algorithm using O(log3|V|) functional operations is presented, where V is the set of vertices of the input graph. Furthermore, answering an open problem posed by Sawitzki (2006) it is shown that every symbolic OBDD-based algorithm for the minimum spanning tree problem needs exponential space (with respect to the OBDD size of the input graph). This result even holds for planar input graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balcázar, J.L., Lozano, A.: The complexity of graph problems for succinctly represented graphs. In: Nagl, M. (ed.) WG 1989. LNCS, vol. 411, pp. 277–285. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  2. Bazlamaçci, C.F., Hindi, K.S.: Minimum-weight spanning tree algorithms. A survey and empirical study. Computers & Operations Research 28, 767–785 (2001)

    Article  MATH  Google Scholar 

  3. Bollig, B.: On the OBDD complexity of the most significant bit of integer multiplication. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 306–317. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Bollig, B.: Exponential space complexity for symbolic maximum flow algorithms in 0-1 networks. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 186–197. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  5. Bollig, B.: On symbolic representations of maximum matchings and (un)directed graphs. In: Proc. of TCS IFIP AICT, vol. 323, pp. 263–300 (2010)

    Google Scholar 

  6. Bollig, B.: Symbolic OBDD-based reachability analysis needs exponential space. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorný, J., Rumpe, B. (eds.) SOFSEM 2010. LNCS, vol. 5901, pp. 224–234. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Bollig, B., Löbbing, M., Sauerhoff, M., Wegener, I.: On the complexity of the hidden weighted bit function for various BDD models. Theoretical Informatics and Applications 33, 103–115 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  8. Borůvka, O.: O jistém problému minimálním. Práce Mor. Pir̆írodovĕd. Spol. v Brnĕ (Acta Societ. Scient. Natur. Moravicae) 3, 37–58 (1926)

    Google Scholar 

  9. Breitbart, Y., Hunt III, H.B., Rosenkrantz, D.J.: On the size of binary decision diagrams representing Boolean functions. Theoretical Computer Science 145, 45–69 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  10. Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Computers 35, 677–691 (1986)

    Article  MATH  Google Scholar 

  11. Bryant, R.E.: On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. IEEE Trans. on Computers 40, 205–213 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  12. Chazelle, B.: A minimum spanning tree algorithm with inverse-Ackermann type complexity. Journal of ACM 47(6), 1028–1047 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  13. Cheriton, D., Tarjan, R.E.: Finding minimum spanning trees. SIAM Journal on Computing 5, 724–742 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  14. Feigenbaum, J., Kannan, S., Vardi, M.V., Viswanathan, M.: Complexity of problems on graphs represented as OBDDs. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol. 1373, pp. 216–226. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  15. Fisler, K., Vardi, M.Y.: Bisimulation, minimization, and symbolic model checking. Formal Methods in System Design 21(1), 39–78 (2002)

    Article  MATH  Google Scholar 

  16. Galperin, H., Wigderson, A.: Succinct representations of graphs. Information and Control 56, 183–198 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  17. Gentilini, R., Piazza, C., Policriti, A.: Computing strongly connected components in a linear number of symbolic steps. In: Proc. of SODA, pp. 573–582. ACM Press, New York (2003)

    Google Scholar 

  18. Gentilini, R., Piazza, C., Policriti, A.: Symbolic graphs: linear solutions to connectivity related problems. Algorithmica 50, 120–158 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  19. Graham, R.L., Hell, P.: On the history of the minimum spanning tree problem. Ann. Hist. Comput. 7, 43–57 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  20. Hachtel, G.D., Somenzi, F.: A symbolic algorithm for maximum flow in 0–1 networks. Formal Methods in System Design 10, 207–219 (1997)

    Article  Google Scholar 

  21. Kannan, S., Naor, M., Rudich, S.: Implicit representations of graphs. SIAM Journal on Discrete Mathematic 5, 596–603 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  22. Karger, D.R., Klein, P.N., Tarjan, R.E.: A randomized linear-time algorithm to find minimum spanning trees. Journal of ACM 42, 321–328 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  23. Meer, K., Rautenbach, D.: On the OBDD size for graphs of bounded tree- and clique-width. Discrete Mathematics 309(4), 843–851 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  24. Nunkesser, R., Woelfel, P.: Representation of graphs by OBDDs. Discrete Applied Mathematics 157(2), 247–261 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  25. Papadimitriou, C.H., Yannakakis, M.: A note on succinct representations of graphs. Information and Control 71, 181–185 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  26. Pettie, S., Ramachandran, V.: An optimal minimum spanning tree algorithm. Journal of ACM 49, 16–34 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  27. 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)

    Chapter  Google Scholar 

  28. Sawitzki, D.: Exponential lower bounds on the space complexity of OBDD-based graph algorithms. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 781–792. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  29. Sawitzki, D.: The complexity of problems on implicitly represented inputs. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831, pp. 471–482. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  30. Sieling, D., Wegener, I.: NC-algorithms for operations on binary decision diagrams. Parallel Processing Letters 48, 139–144 (1993)

    Article  MathSciNet  Google Scholar 

  31. Talamo, M., Vocca, P.: Representing graphs implicitly using almost optimal space. Discrete Applied Mathematics 108, 193–210 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  32. Wegener, I.: Branching Programs and Binary Decision Diagrams - Theory and Applications. SIAM Monographs on Discrete Mathematics and Applications (2000)

    Google Scholar 

  33. Woelfel, P.: Symbolic topological sorting with OBDDs. Journal of Discrete Algorithms 4(1), 51–71 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LS2 Informatik, TU Dortmund, 44221, Dortmund, Germany

    Beate Bollig

Authors
  1. Beate Bollig
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Texas at Dallas, 75080, Richardson, TX, USA

    Weili Wu  & Ovidiu Daescu  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bollig, B. (2010). On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem. In: Wu, W., Daescu, O. (eds) Combinatorial Optimization and Applications. COCOA 2010. Lecture Notes in Computer Science, vol 6509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17461-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17461-2_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17460-5

  • Online ISBN: 978-3-642-17461-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation