{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:01:50Z","timestamp":1725562910398},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642151545"},{"type":"electronic","value":"9783642151552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15155-2_18","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T20:17:45Z","timestamp":1281730665000},"page":"186-197","source":"Crossref","is-referenced-by-count":3,"title":["Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks"],"prefix":"10.1007","author":[{"given":"Beate","family":"Bollig","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","first-page":"277","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J.L. Balc\u00e1zar","year":"1990","unstructured":"Balc\u00e1zar, J.L., Lozano, A.: The complexity of graph problems for succinctly represented graphs. In: Nagl, M. (ed.) WG 1989. LNCS, vol.\u00a0411, pp. 277\u2013285. Springer, Heidelberg (1990)"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-540-79228-4_27","volume-title":"Theory and Applications of Models of Computation","author":"B. Bollig","year":"2008","unstructured":"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.\u00a04978, pp. 306\u2013317. Springer, Heidelberg (2008)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Bollig, B.: Symbolic OBDD-based reachability analysis needs exponential space. In: Proc. of SOFSEM. LNCS, vol.\u00a05901, pp. 224\u2013234. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-11266-9_19"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Computers\u00a035, 677\u2013691 (1986)","journal-title":"IEEE Trans. on Computers"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1109\/12.73590","volume":"40","author":"R.E. Bryant","year":"1991","unstructured":"Bryant, R.E.: On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. IEEE Trans. on Computers\u00a040, 205\u2013213 (1991)","journal-title":"IEEE Trans. on Computers"},{"key":"18_CR6","series-title":"Monographs in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, Heidelberg (1999)"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/BFb0028563","volume-title":"STACS 1998","author":"J. Feigenbaum","year":"1998","unstructured":"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.\u00a01373, pp. 216\u2013226. Springer, Heidelberg (1998)"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0019-9958(83)80004-7","volume":"56","author":"H. Galperin","year":"1983","unstructured":"Galperin, H., Wigderson, A.: Succinct representations of graphs. Information and Control\u00a056, 183\u2013198 (1983)","journal-title":"Information and Control"},{"key":"18_CR9","first-page":"573","volume-title":"Proc. of SODA","author":"R. Gentilini","year":"2003","unstructured":"Gentilini, R., Piazza, C., Policriti, A.: Computing strongly connected components in a linear number of symbolic steps. In: Proc. of SODA, pp. 573\u2013582. ACM Press, New York (2003)"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s00453-007-9079-5","volume":"50","author":"R. Gentilini","year":"2008","unstructured":"Gentilini, R., Piazza, C., Policriti, A.: Symbolic graphs: linear solutions to connectivity related problems. Algorithmica\u00a050, 120\u2013158 (2008)","journal-title":"Algorithmica"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1016\/j.cor.2005.05.009","volume":"34","author":"T. Gu","year":"2007","unstructured":"Gu, T., Xu, Z.: The symbolic algorithms for maximum flow in networks. Computers & Operations Research\u00a034, 799\u2013816 (2007)","journal-title":"Computers & Operations Research"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1023\/A:1008651924240","volume":"10","author":"G.D. Hachtel","year":"1997","unstructured":"Hachtel, G.D., Somenzi, F.: A symbolic algorithm for maximum flow in 0\u2009\u2212\u20091 networks. Formal Methods in System Design\u00a010, 207\u2013219 (1997)","journal-title":"Formal Methods in System Design"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF02579407","volume":"6","author":"R.M. Karp","year":"1986","unstructured":"Karp, R.M., Upfal, E., Wigderson, A.: Constructing a perfect matching is in Random NC. Combinatorica\u00a06, 35\u201348 (1986)","journal-title":"Combinatorica"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0019-9958(86)80009-2","volume":"71","author":"C.H. Papadimitriou","year":"1986","unstructured":"Papadimitriou, C.H., Yannakakis, M.: A note on succinct representations of graphs. Information and Control\u00a071, 181\u2013185 (1986)","journal-title":"Information and Control"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/978-3-540-24618-3_26","volume-title":"SOFSEM 2004: Theory and Practice of Computer Science","author":"D. Sawitzki","year":"2004","unstructured":"Sawitzki, D.: Implicit flow maximization by iterative squaring. In: Van Emde Boas, P., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2004. LNCS, vol.\u00a02932, pp. 301\u2013313. Springer, Heidelberg (2004)"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-540-30577-4_33","volume-title":"SOFSEM 2005: Theory and Practice of Computer Science","author":"D. Sawitzki","year":"2005","unstructured":"Sawitzki, D.: Lower bounds on the OBDD size of graphs of some popular functions. In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol.\u00a03381, pp. 298\u2013309. Springer, Heidelberg (2005)"},{"key":"18_CR17","unstructured":"Sawitzki, D.: Algorithmik und Komplexit\u00e4t OBDD-repr\u00e4sentierter Graphen. PhD thesis, University of Dortmund (2006) (in German)"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/11682462_71","volume-title":"LATIN 2006: Theoretical Informatics","author":"D. Sawitzki","year":"2006","unstructured":"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.\u00a03887, pp. 781\u2013792. Springer, Heidelberg (2006)"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/11611257_45","volume-title":"SOFSEM 2006: Theory and Practice of Computer Science","author":"D. Sawitzki","year":"2006","unstructured":"Sawitzki, D.: The complexity of problems on implicitly represented inputs. In: Wiedermann, J., Tel, G., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2006. LNCS, vol.\u00a03831, pp. 471\u2013482. Springer, Heidelberg (2006)"},{"key":"18_CR20","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0020-0190(93)90256-9","volume":"48","author":"D. Sieling","year":"1993","unstructured":"Sieling, D., Wegener, I.: NC-algorithms for operations on binary decision diagrams. Parallel Processing Letters\u00a048, 139\u2013144 (1993)","journal-title":"Parallel Processing Letters"},{"issue":"1","key":"18_CR21","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.jda.2005.01.008","volume":"4","author":"P. Woelfel","year":"2006","unstructured":"Woelfel, P.: Symbolic topological sorting with OBDDs. Journal of Discrete Algorithms\u00a04(1), 51\u201371 (2006)","journal-title":"Journal of Discrete Algorithms"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15155-2_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:47:16Z","timestamp":1619786836000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15155-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642151545","9783642151552"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15155-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}