{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:23Z","timestamp":1740122423477,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,1,16]],"date-time":"2019-01-16T00:00:00Z","timestamp":1547596800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,1,16]],"date-time":"2019-01-16T00:00:00Z","timestamp":1547596800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"crossref","award":["16H03118"],"award-info":[{"award-number":["16H03118"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["18H01133"],"award-info":[{"award-number":["18H01133"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s10878-019-00379-0","type":"journal-article","created":{"date-parts":[[2019,1,16]],"date-time":"2019-01-16T13:59:43Z","timestamp":1547647183000},"page":"278-291","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Non-adaptive group testing on graphs with connectivity"],"prefix":"10.1007","volume":"38","author":[{"given":"Song","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuji","family":"Matsuura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Miao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3671-9434","authenticated-orcid":false,"given":"Maiko","family":"Shigeno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,16]]},"reference":[{"key":"379_CR1","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1109\/TIT.2011.2169535","volume":"58","author":"M Cheraghchi","year":"2012","unstructured":"Cheraghchi M, Karbasi A, Mohajer S, Saligrama V (2012) Graph-constrained group testing. IEEE Trans Inf Theory 58:248\u2013262","journal-title":"IEEE Trans Inf Theory"},{"key":"379_CR2","series-title":"Series on applied mathematics","volume-title":"Pooling designs and nonadaptive group testing: important tools for DNA sequencing","author":"DZ Du","year":"2006","unstructured":"Du DZ, Hwang FK (2006) Pooling designs and nonadaptive group testing: important tools for DNA sequencing, vol 18. Series on applied mathematics. World Scientific Publishing Co. Pte. Ltd., Hackensack"},{"key":"379_CR3","first-page":"7","volume":"18","author":"AG D\u2019yachkov","year":"1982","unstructured":"D\u2019yachkov AG, Rykov VV (1982) Bounds for the length of disjunctive codes. Probl Inf Transm 18:7\u201313","journal-title":"Probl Inf Transm"},{"key":"379_CR4","doi-asserted-by":"crossref","unstructured":"Harvey NJ, Patrascu M, Wen Y, Yekhanin S, Chan VW (2007) Non-adaptive fault diagnosis for all-optical networks via combinatorial group testing on graphs. In: Proceedings of the IEEE INFOCOM 2007\u201426th IEEE international conference on computer communications, pp 697\u2013705","DOI":"10.1109\/INFCOM.2007.87"},{"key":"379_CR5","doi-asserted-by":"crossref","unstructured":"Karbasi A, Zadimoghaddam M (2012) Sequential group testing with graph constraints. In: 2012 IEEE information theory workshop, pp 292\u2013296","DOI":"10.1109\/ITW.2012.6404678"},{"key":"379_CR6","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","volume":"10","author":"W Kautz","year":"1964","unstructured":"Kautz W, Singleton R (1964) Nonrandom binary superimposed codes. IEEE Trans Inf Theory 10:363\u2013377","journal-title":"IEEE Trans Inf Theory"},{"key":"379_CR7","doi-asserted-by":"publisher","first-page":"1784","DOI":"10.1109\/50.643550","volume":"15","author":"CS Li","year":"1997","unstructured":"Li CS, Ramaswami R (1997) Automatic fault detection, isolation, and recovery in transparent all-optical networks. J Lightwave Technol 15:1784\u20131793","journal-title":"J Lightwave Technol"},{"key":"379_CR8","doi-asserted-by":"publisher","first-page":"1508","DOI":"10.1109\/JSAC.2005.852182","volume":"23","author":"C Mas","year":"2005","unstructured":"Mas C, Tomkos I, Tonguz OK (2005) Failure location algorithm for transparent optical networks. IEEE J Sel Areas Commun 23:1508\u20131519","journal-title":"IEEE J Sel Areas Commun"},{"key":"379_CR9","doi-asserted-by":"crossref","unstructured":"Tapolcai J, Ronyai L, Ho PH (2010) Optimal solutions for single fault localization in two dimensional lattice networks. In: 2010 Proceedings IEEE INFOCOM, pp 1\u20135","DOI":"10.1109\/INFCOM.2010.5462251"},{"key":"379_CR10","doi-asserted-by":"crossref","unstructured":"Ufimtsev V, Bhowmick S (2013) Application of group testing in identifying high betweenness centrality vertices in complex networks. In: Proceedings of eleventh workshop on mining and learning with graphs","DOI":"10.1109\/IPDPSW.2013.171"},{"key":"379_CR11","doi-asserted-by":"publisher","first-page":"3358","DOI":"10.1109\/JLT.2005.855695","volume":"23","author":"Y Wen","year":"2005","unstructured":"Wen Y, Chan VWS, Zheng L (2005) Efficient fault-diagnosis algorithms for all-optical wdm networks with probabilistic link failures. J Lightwave Technol 23:3358\u20133371","journal-title":"J Lightwave Technol"},{"key":"379_CR12","doi-asserted-by":"crossref","unstructured":"Wu B, Yeung KL (2007) Monitoring cycle design for fast link failure detection in all-optical networks. In: IEEE GLOBECOM 2007\u2014IEEE global telecommunications conference, pp 2315\u20132319","DOI":"10.1109\/GLOCOM.2007.441"},{"key":"379_CR13","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s11107-005-7355-3","volume":"11","author":"H Zeng","year":"2006","unstructured":"Zeng H, Huang C, Vukovic A (2006) A novel fault detection and localization scheme for mesh all-optical networks based on monitoring-cycles. Photonic Netw Commun 11:277\u2013286","journal-title":"Photonic Netw Commun"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-019-00379-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00379-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00379-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T12:49:29Z","timestamp":1589719769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-019-00379-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,16]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["379"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00379-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2019,1,16]]},"assertion":[{"value":"16 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}