{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:36:46Z","timestamp":1725561406232},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206958"},{"type":"electronic","value":"9783540245872"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24587-2_57","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T04:59:19Z","timestamp":1280379559000},"page":"554-564","source":"Crossref","is-referenced-by-count":7,"title":["Biconnectivity on Symbolically Represented Graphs: A Linear Solution"],"prefix":"10.1007","author":[{"given":"Raffaella","family":"Gentilini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Policriti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"57_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. Aho","year":"1974","unstructured":"Aho, A., Hopcroft, J., Ullman, J.: The Design and Analysis of Computer Algorithms. Addison Wesley, Reading (1974)"},{"issue":"6","key":"57_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/TC.1978.1675141","volume":"27","author":"S.B. Akers","year":"1978","unstructured":"Akers, S.B.: Binary decision diagrams. IEEE Transaction on Computers\u00a027(6), 509\u2013516 (1978)","journal-title":"IEEE Transaction on Computers"},{"key":"57_CR3","unstructured":"Berel, P.A., Xie, A.: Implicit enumeration of strongly connected components. In: Proceeding of the International Conference on Computer-Aided Design (ICCAD 1999), pp. 37\u201340 (1999)"},{"key":"57_CR4","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)"},{"issue":"3","key":"57_CR5","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R.E. Bryant","year":"1992","unstructured":"Bryant, R.E.: Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys\u00a024(3), 293\u2013318 (1992)","journal-title":"ACM Computing Surveys"},{"issue":"2","key":"57_CR6","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","volume":"98","author":"J.R. Burch","year":"1992","unstructured":"Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: 1020 states and beyond. Information and Computation\u00a098(2), 142\u2013170 (1992)","journal-title":"Information and Computation"},{"key":"57_CR7","volume-title":"Model checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model checking. MIT Press, Cambridge (1999)"},{"key":"57_CR8","unstructured":"Gentilini, R., Piazza, C., Policriti, A.: Computing strongly connected components in a linear number of symbolic steps. In: Proceeding of the 14-th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), pp. 573\u2013582 (2003)"},{"key":"57_CR9","doi-asserted-by":"crossref","unstructured":"Gentilini, R., Policriti, A.: Biconnectivity on simbolically represented graphs: a linear solution. RR 13-2003, Dep. of Computer Science, Udine University, Italy","DOI":"10.1007\/978-3-540-24587-2_57"},{"issue":"4","key":"57_CR10","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1002\/j.1538-7305.1959.tb01585.x","volume":"38","author":"C.Y. Lee","year":"1959","unstructured":"Lee, C.Y.: Binary decision programs. Bell System Technical Journal\u00a038(4), 985\u2013999 (1959)","journal-title":"Bell System Technical Journal"},{"key":"57_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic model checking: an approach to the state explosion problem","author":"K.L. McMillan","year":"1993","unstructured":"McMillan, K.L.: Symbolic model checking: an approach to the state explosion problem. Kluwer Academic Publishers, Dordrecht (1993)"},{"key":"57_CR12","series-title":"Nato Science Series F: Computer and Systems Sciences","first-page":"303","volume-title":"Calculational System Design","author":"F. Somenzi","year":"1999","unstructured":"Somenzi, F.: Calculational System Design. chapter Binary Decision Diagrams. Nato Science Series F: Computer and Systems Sciences, vol.\u00a0173, pp. 303\u2013366. IOS Press, Amsterdam (1999)"},{"issue":"2","key":"57_CR13","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth first search and linear graph algorithms. SIAM Journal on Computing\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24587-2_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T19:56:02Z","timestamp":1559332562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24587-2_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206958","9783540245872"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24587-2_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}