{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T03:11:38Z","timestamp":1775272298610,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030046507","type":"print"},{"value":"9783030046514","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04651-4_19","type":"book-chapter","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T14:56:50Z","timestamp":1542293810000},"page":"281-295","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exact Computation of Strongly Connected Reliability by Binary Decision Diagrams"],"prefix":"10.1007","author":[{"given":"Hirofumi","family":"Suzuki","sequence":"first","affiliation":[]},{"given":"Masakazu","family":"Ishihata","sequence":"additional","affiliation":[]},{"given":"Shin-ichi","family":"Minato","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"issue":"3","key":"19_CR1","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1109\/TR.2010.2055924","volume":"59","author":"JM Won","year":"2010","unstructured":"Won, J.M., Karray, F.: Cumulative update of all-terminal reliability for faster feasibility decision. IEEE Trans. Reliab. 59(3), 551\u2013562 (2010)","journal-title":"IEEE Trans. Reliab."},{"issue":"2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1109\/JIOT.2015.2496259","volume":"3","author":"JH Park","year":"2016","unstructured":"Park, J.H.: All-terminal reliability analysis of wireless networks of redundant radio modules. IEEE Internet Things J. 3(2), 219\u2013230 (2016)","journal-title":"IEEE Internet Things J."},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1002\/net.20060","volume":"45","author":"J Brown","year":"2005","unstructured":"Brown, J., Li, X.: The strongly connected reliability of complete digraphs. Netw.: Int. J. 45, 165\u2013168 (2005)","journal-title":"Netw.: Int. J."},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8, 410\u2013421 (1979)","journal-title":"SIAM J. Comput."},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Karger, D.R.: A randomized fully polynomial time approximation scheme for the all terminal network reliability problem. In: Proceedings of the Twenty-seventh Annual ACM Symposium on Theory of Computing, STOC 1995, pp. 11\u201317. ACM, New York (1995)","DOI":"10.1145\/225058.225069"},{"key":"19_CR6","first-page":"714","volume":"82","author":"H Imai","year":"1999","unstructured":"Imai, H., Sekine, K., Imai, K.: Computational investigations of all-terminal network reliability via BDDs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 82, 714\u2013721 (1999)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<81::AID-NET2>3.0.CO;2-G","volume":"30","author":"FK Hwang","year":"1997","unstructured":"Hwang, F.K., Wright, P.E., Hu, X.: Exact reliabilities of most reliable double-loop networks. Networks 30, 81\u201390 (1997)","journal-title":"Networks"},{"issue":"8","key":"19_CR8","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. 35(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1137\/0210019","volume":"10","author":"GN Frederickson","year":"1981","unstructured":"Frederickson, G.N., J\u00e1J\u00e1, J.: Approximation algorithms for several graph augmentation problems. SIAM J. Comput. 10(2), 270\u2013283 (1981)","journal-title":"SIAM J. Comput."},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Vincent, D., Cecile, B.: Transitive reduction for social network analysis and visualization. In: Proceedings of the 2005 IEEE\/WIC\/ACM International Conference on Web Intelligence, WI 2005, pp. 128\u2013131. IEEE Computer Society, Washington, D.C. (2005)","DOI":"10.1109\/WI.2005.152"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Ardito, C.F., Paola, D.D., Gasparri, A.: Decentralized estimation of the minimum strongly connected subdigraph for robotic networks with limited field of view. In: 2012 IEEE 51st IEEE Conference on Decision and Control (CDC), pp. 5304\u20135309, December 2012","DOI":"10.1109\/CDC.2012.6426108"},{"issue":"7","key":"19_CR12","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1089\/cmb.2007.0015","volume":"14","author":"R Albert","year":"2007","unstructured":"Albert, R., DasGupta, B., Dondi, R., Sema Kachalo, E.S., Zelikovsky, A., Westbrooks, K.: A novel method for signal transduction network inference from indirect experimental evidence. J. Comput. Biol. 14(7), 927\u2013949 (2007)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/biology3010001","volume":"3","author":"S Aditya","year":"2014","unstructured":"Aditya, S., DasGupta, B., Karpinski, M.: Algorithmic perspectives of network transitive reduction problems and their applications to synthesis and analysis of biological networks. Biology 3(1), 1\u201321 (2014)","journal-title":"Biology"},{"issue":"9","key":"19_CR14","doi-asserted-by":"publisher","first-page":"1773","DOI":"10.1587\/transfun.E100.A.1773","volume":"E100.A","author":"Jun KAWAHARA","year":"2017","unstructured":"Kawahara, J., Inoue, T., Iwashita, H., Minato, S.: Frontier-based search for enumerating all constrained subgraphs with compressed representation. IEICE Trans. Fundam. E100-A(9), 1773\u20131784 (2017)","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"issue":"6","key":"19_CR15","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0020-0190(92)90234-M","volume":"42","author":"NG Kinnersley","year":"1992","unstructured":"Kinnersley, N.G.: The vertex separation number of a graph equals its path-width. Inf. Process. Lett. 42(6), 345\u2013350 (1992)","journal-title":"Inf. Process. Lett."},{"key":"19_CR16","unstructured":"Inoue, Y., Minato, S.: Acceleration of ZDD construction for subgraph enumeration via path-width optimization. TCS-TR-A-16-80. Hokkaido University (2016)"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1016\/j.ipl.2012.05.007","volume":"112","author":"R Yoshinaka","year":"2012","unstructured":"Yoshinaka, R., Kawahara, J., Denzumi, S., Arimura, H., Minato, S.: Counterexamples to the long-standing conjecture on the complexity of BDD binary operations. Inf. Process. Lett. 112, 636\u2013640 (2012)","journal-title":"Inf. Process. Lett."},{"key":"19_CR18","series-title":"Artificial Intelligence: Foundations, Theory, and Algorithms","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42849-9","volume-title":"Decision Diagrams for Optimization","author":"D Bergman","year":"2016","unstructured":"Bergman, D., Cir\u00e9, A.A., van Hoeve, W., Hooker, J.N.: Decision Diagrams for Optimization. Artificial Intelligence: Foundations, Theory, and Algorithms. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42849-9"},{"key":"19_CR19","unstructured":"Maurer, P.: Generating strongly connected random graphs. In: Proceedings of the 2017 International Conference on Modeling, Simulation and Visualization Methods, MSV 2017, pp. 3\u20136. CSCE, Las Vegas (2017)"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-540-25960-2_12","volume-title":"Integer Programming and Combinatorial Optimization","author":"E Boros","year":"2004","unstructured":"Boros, E., Elbassioni, K., Gurvich, V., Khachiyan, L.: Enumerating minimal dicuts and strongly connected subgraphs and related geometric problems. In: Bienstock, D., Nemhauser, G. (eds.) IPCO 2004. LNCS, vol. 3064, pp. 152\u2013162. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25960-2_12"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04651-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T02:31:57Z","timestamp":1775269917000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04651-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046507","9783030046514"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04651-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spacl.kennesaw.edu\/cocoa2018\/cfp.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}