{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T04:46:30Z","timestamp":1778647590355,"version":"3.51.4"},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4156,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0166-218x(01)00181-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T07:52:51Z","timestamp":1027583571000},"page":"99-108","source":"Crossref","is-referenced-by-count":9,"title":["A group testing problem for graphs with several defective edges"],"prefix":"10.1016","volume":"117","author":[{"given":"Petra","family":"Johann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00181-0_BIB1","series-title":"Combinatorial Search, Wiley-Teubner Series in Computer Science","author":"Aigner","year":"1988"},{"issue":"2","key":"10.1016\/S0166-218X(01)00181-0_BIB2","first-page":"137","article-title":"Group testing with three defectives","volume":"24","author":"Bosnjak","year":"1994","journal-title":"Zb. Rad., Prir.-Mat. Fak., Univ. Novom Sadu, Ser. Mat."},{"key":"10.1016\/S0166-218X(01)00181-0_BIB3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1137\/0602005","article-title":"A group testing problem on two disjoint sets","volume":"2","author":"Chang","year":"1981","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0166-218X(01)00181-0_BIB4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0166-218X(92)00120-B","article-title":"A tight upper bound for group testing in graphs","volume":"48","author":"Damaschke","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00181-0_BIB5","series-title":"Combinatorial Group Testing and its Applications","author":"Du","year":"1993"},{"key":"10.1016\/S0166-218X(01)00181-0_BIB6","series-title":"Combinatorics and Graph Theory","first-page":"229","article-title":"Group testing with two defectives","author":"Li","year":"1993"},{"key":"10.1016\/S0166-218X(01)00181-0_BIB7","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0166-218X(95)00120-G","article-title":"A group testing problem for hypergraphs of bounded rank","volume":"66","author":"Triesch","year":"1996","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01001810?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01001810?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T23:51:01Z","timestamp":1557100261000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01001810"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0166218X01001810"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00181-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}