{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:00Z","timestamp":1759638240562},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540207795"},{"type":"electronic","value":"9783540246183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24618-3_26","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T11:31:03Z","timestamp":1283686263000},"page":"301-313","source":"Crossref","is-referenced-by-count":20,"title":["Implicit Flow Maximization by Iterative Squaring"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Sawitzki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","first-page":"688","volume-title":"Design Automation Conference","author":"R. Bryant","year":"1985","unstructured":"Bryant, R.: Symbolic Manipulation of Boolean Functions Using a Graphical Representation. In: Design Automation Conference, pp. 688\u2013694. ACM Press, New York (1985)"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R. Bryant","year":"1986","unstructured":"Bryant, R.: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers\u00a035, 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"key":"26_CR3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719789","volume-title":"Branching Programs and Binary Decision Diagrams","author":"I. Wegener","year":"2000","unstructured":"Wegener, I.: Branching Programs and Binary Decision Diagrams. SIAM, Philadelphia (2000)"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/978-3-540-45138-9_61","volume-title":"Mathematical Foundations of Computer Science 2003","author":"P. Woelfel","year":"2003","unstructured":"Woelfel, P.: Symbolic Topological Sorting with OBDDs. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 671\u2013680. Springer, Heidelberg (2003)"},{"unstructured":"Sawitzki, D.: Implicit Flow Maximization on Grid Networks. Technical Report, Universit\u00e4t Dortmund (2003)","key":"26_CR5"},{"unstructured":"Woelfel, P.: The OBDD-Size of Cographs. Internal Report, Universit\u00e4t Dortmund (2003)","key":"26_CR6"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-40922-X_4","volume-title":"Formal Methods in Computer-Aided Design","author":"R. Bloem","year":"2000","unstructured":"Bloem, R., Gabow, H., Somenzi, F.: An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps. In: Johnson, S.D., Hunt Jr., W.A. (eds.) FMCAD 2000. LNCS, vol.\u00a01954, pp. 37\u201354. Springer, Heidelberg (2000)"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-40922-X_10","volume-title":"Formal Methods in Computer-Aided Design","author":"K. Ravi","year":"2000","unstructured":"Ravi, K., Bloem, R., Somenzi, F.: A Comparative Study of Symbolic Algorithms for the Computation of Fair Cycles. In: Johnson, S.D., Hunt Jr., W.A. (eds.) FMCAD 2000. LNCS, vol.\u00a01954, pp. 143\u2013160. Springer, Heidelberg (2000)"},{"key":"26_CR9","volume-title":"Logic Synthesis and Verification Algorithms","author":"G. Hachtel","year":"1996","unstructured":"Hachtel, G., Somenzi, F.: Logic Synthesis and Verification Algorithms. Kluwer Academic Publishers, Boston (1996)"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1023\/A:1008651924240","volume":"10","author":"G. Hachtel","year":"1997","unstructured":"Hachtel, G., Somenzi, F.: A Symbolic Algorithm for Maximum Flow in 0\u20131 Networks. Formal Methods in System Design\u00a010, 207\u2013219 (1997)","journal-title":"Formal Methods in System Design"},{"key":"26_CR11","volume-title":"Graph Algorithms","author":"S. Even","year":"1979","unstructured":"Even, S.: Graph Algorithms. Computer Science Press, Rockville (1979)"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/3-540-56496-9_31","volume-title":"Computer Aided Verification","author":"R. Hojati","year":"1993","unstructured":"Hojati, R., Touati, H., Kurshan, R., Brayton, R.: Efficient \u03c9-Regular Language Containment. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol.\u00a0663, pp. 396\u2013409. Springer, Heidelberg (1993)"},{"unstructured":"Woelfel, P.: Private Communication (2003)","key":"26_CR13"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2004: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24618-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T00:29:03Z","timestamp":1553041743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24618-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540207795","9783540246183"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24618-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}