{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:07Z","timestamp":1725558967476},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241324"},{"type":"electronic","value":"9783540305590"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30559-0_13","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T19:01:42Z","timestamp":1278097302000},"page":"154-167","source":"Crossref","is-referenced-by-count":12,"title":["A Symbolic Approach to the All-Pairs Shortest-Paths Problem"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Sawitzki","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","first-page":"188","volume-title":"ICCAD 1993","author":"R.I. Bahar","year":"1993","unstructured":"Bahar, R.I., Frohm, E.A., Gaona, C.M., Hachtel, G.D., Macii, E., Pardo, A., Somenzi, F.: Algebraic decision diagrams and their applications. In: ICCAD 1993, pp. 188\u2013191. IEEE Press, Los Alamitos (1993)"},{"key":"13_CR2","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.N., 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":"13_CR3","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1145\/317825.317964","volume-title":"DAC 1985","author":"R.E. Bryant","year":"1985","unstructured":"Bryant, R.E.: Symbolic manipulation of Boolean functions using a graphical representation. In: DAC 1985, pp. 688\u2013694. ACM Press, New York (1985)"},{"key":"13_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 Transactions on Computers\u00a035, 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1006\/jagm.2000.1117","volume":"38","author":"E. Cohen","year":"2001","unstructured":"Cohen, E., Zwick, U.: All-pairs small-stretch paths. Journal of Algorithms\u00a038, 335\u2013353 (2001)","journal-title":"Journal of Algorithms"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1137\/S0097539797327908","volume":"29","author":"D. Dor","year":"2000","unstructured":"Dor, D., Halperin, S., Zwick, U.: All-pairs almost shortest paths. SIAM Journal on Computing\u00a029, 1740\u20131759 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR7","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. Springer, Heidelberg (1999)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J., Kannan, S., Vardi, M.Y., Viswanathan, M.: Complexity of problems on graphs represented as OBDDs. Chicago Journal of Theoretical Computer Science 1999 (1999)","DOI":"10.1007\/BFb0028563"},{"key":"13_CR9","first-page":"573","volume-title":"SODA 2003","author":"R. Gentilini","year":"2003","unstructured":"Gentilini, R., Piazza, C., Policriti, A.: Computing strongly connected components in a linear number of symbolic steps. In: SODA 2003, pp. 573\u2013582. ACM Press, New York (2003)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-540-24587-2_57","volume-title":"Algorithms and Computation","author":"R. Gentilini","year":"2003","unstructured":"Gentilini, R., Policriti, A.: Biconnectivity on symbolically represented graphs: A linear solution. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol.\u00a02906, pp. 554\u2013564. Springer, Heidelberg (2003)"},{"key":"13_CR11","first-page":"70","volume-title":"ICCAD 1994","author":"G.D. Hachtel","year":"1994","unstructured":"Hachtel, G.D., Hermida, M., Pardo, A., Poncino, M., Somenzi, F.: Re-Encoding sequential circuits to reduce power dissipation. In: ICCAD 1994, pp. 70\u201373. IEEE Press, Los Alamitos (1994)"},{"key":"13_CR12","volume-title":"Logic Synthesis and Verification Algorithms","author":"G.D. Hachtel","year":"1996","unstructured":"Hachtel, G.D., Somenzi, F.: Logic Synthesis and Verification Algorithms. Kluwer Academic Publishers, Boston (1996)"},{"key":"13_CR13","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\u20131 networks. Formal Methods in System Design\u00a010, 207\u2013219 (1997)","journal-title":"Formal Methods in System Design"},{"key":"13_CR14","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.P., Brayton, R.K.: Efficient \u03c9-regular language containment. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol.\u00a0663, pp. 396\u2013409. Springer, Heidelberg (1993)"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/3-540-46002-0_22","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H. Jin","year":"2002","unstructured":"Jin, H., Kuehlmann, A., Somenzi, F.: Fine-grain conjunction scheduling for symbolic reachability analysis. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol.\u00a02280, p. 312\u2013326. Springer, Heidelberg (2002)"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-46035-7_15","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"M. Krause","year":"2002","unstructured":"Krause, M.: BDD-based cryptanalysis of keystream generators. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 222\u2013237. Springer, Heidelberg (2002)"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/337292.337305","volume-title":"DAC 2000","author":"I. Moon","year":"2000","unstructured":"Moon, I., Kukula, J.H., Ravi, K., Somenzi, F.: To split or to conjoin: The question in image computation. In: DAC 2000, pp. 23\u201328. ACM Press, New York (2000)"},{"key":"13_CR18","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":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-24838-5_36","volume-title":"Experimental and Efficient Algorithms","author":"D. Sawitzki","year":"2004","unstructured":"Sawitzki, D.: Experimental studies of symbolic shortest-path algorithms. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol.\u00a03059, pp. 482\u2013497. Springer, Heidelberg (2004)"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"13_CR21","unstructured":"Sawitzki, D.: Implicit flow maximization on grid networks. Technical report, Universit\u00e4t Dortmund (2004)"},{"key":"13_CR22","unstructured":"Sawitzki, D.: Implicit maximization of flows over time. Technical report, Universit\u00e4t Dortmund (2004)"},{"key":"13_CR23","unstructured":"Sawitzki, D.: On graphs with characteristic bounded-width functions. Technical report, Universit\u00e4t Dortmund (2004)"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Wegener, I.: Branching Programs and Binary Decision Diagrams. SIAM, Philadelphia (2000)","DOI":"10.1137\/1.9780898719789"},{"key":"13_CR25","unstructured":"Woelfel, P.: The OBDD-size of cographs. Internal report, Universit\u00e4t Dortmund (2003)"},{"key":"13_CR26","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)"},{"key":"13_CR27","first-page":"37","volume-title":"ICCAD 1999","author":"A. Xie","year":"1999","unstructured":"Xie, A., Beerel, P.A.: Implicit enumeration of strongly connected components. In: ICCAD 1999, pp. 37\u201340. ACM Press, New York (1999)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30559-0_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:22:18Z","timestamp":1605759738000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30559-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241324","9783540305590"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30559-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}