{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:37:48Z","timestamp":1759333068426},"reference-count":49,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T00:00:00Z","timestamp":1684281600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T00:00:00Z","timestamp":1684281600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,5,17]]},"DOI":"10.1109\/infocom53939.2023.10228897","type":"proceedings-article","created":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T17:40:43Z","timestamp":1693330843000},"page":"1-10","source":"Crossref","is-referenced-by-count":9,"title":["A Fast and Exact Evaluation Algorithm for the Expected Number of Connected Nodes: an Enhanced Network Reliability Measure"],"prefix":"10.1109","author":[{"given":"Kengo","family":"Nakamura","sequence":"first","affiliation":[{"name":"NTT Corporation,NTT Communication Science Laboratories,Kyoto,Japan"}]},{"given":"Takeru","family":"Inoue","sequence":"additional","affiliation":[{"name":"NTT Corporation,NTT Communication Science Laboratories,Kyoto,Japan"}]},{"given":"Masaaki","family":"Nishino","sequence":"additional","affiliation":[{"name":"NTT Corporation,NTT Communication Science Laboratories,Kyoto,Japan"}]},{"given":"Norihito","family":"Yasuda","sequence":"additional","affiliation":[{"name":"NTT Corporation,NTT Communication Science Laboratories,Kyoto,Japan"}]},{"given":"Shin-Ichi","family":"Minato","sequence":"additional","affiliation":[{"name":"Kyoto University,Graduate School of Informatics,Kyoto,Japan"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.06.024"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.814364"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2011.6134506"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5461984"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.86.3682"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1038\/35019019"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2011.6005789"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2010.5679556"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3152042.3152075"},{"key":"ref18","first-page":"1","article-title":"Quantitative and qualitative network robustness analysis under different multiple failure scenarios","author":"manzano","year":"2011","journal-title":"International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT) 2011"},{"journal-title":"Sapporo","year":"0","author":"minato","key":"ref46"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2004.842540"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/2560359"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_44"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2014.2338253"},{"key":"ref41","article-title":"Efficient computation of the number of paths in a grid graph with minimal perfect hash functions","author":"iwashita","year":"2013","journal-title":"Division of Computer Science Hokkaido University Tech Rep TCS-TR-A-13-64"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2009.5199006"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/WSC.2012.6465033"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/AUTEEE48671.2019.9033176"},{"key":"ref8","first-page":"1469","article-title":"Computing all-terminal reliability of stochastic networks with binary decision diagrams","author":"hardy","year":"2005","journal-title":"11th International Symposium on Applied Stochastic Models"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICC45855.2022.9838781"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1177\/1748006X20962258"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SCAC.1995.523656"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/35.214889"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2016.2626384"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/0405003"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.822655"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31955-9_3"},{"key":"ref37","article-title":"Acceleration of ZDD construction for subgraph enumeration via pathwidth optimization","author":"inoue","year":"2016","journal-title":"Division of Computer Science Hokkaido University Tech Rep TCS-TR-A-16-80"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(83)90079-5"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM46510.2021.9685283"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2018.2877775"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2007.896770"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717761"},{"key":"ref2","first-page":"1135","article-title":"Reliability specification for communication networks based on the failure-influence","author":"nojo","year":"1987","journal-title":"Proc of IEEE Globecom"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/9781119224006"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111002"},{"journal-title":"TdZdd","year":"0","author":"iwashita","key":"ref38"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/net.20300"},{"journal-title":"The Combinatorics of Network Reliability","year":"1987","author":"colbourn","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2007.898572"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.23919\/ONDM.2017.7958546"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCE.1958.6372698"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2021.3066526"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485859"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/AINA.2010.148"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2019.03.026"}],"event":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications","start":{"date-parts":[[2023,5,17]]},"location":"New York City, NY, USA","end":{"date-parts":[[2023,5,20]]}},"container-title":["IEEE INFOCOM 2023 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10228851\/10228852\/10228897.pdf?arnumber=10228897","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T17:45:22Z","timestamp":1695059122000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10228897\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,17]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/infocom53939.2023.10228897","relation":{},"subject":[],"published":{"date-parts":[[2023,5,17]]}}}