{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T03:40:16Z","timestamp":1648784416127},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,3,26]],"date-time":"2013-03-26T00:00:00Z","timestamp":1364256000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1007\/s00373-013-1287-y","type":"journal-article","created":{"date-parts":[[2013,3,25]],"date-time":"2013-03-25T07:29:10Z","timestamp":1364196550000},"page":"661-669","source":"Crossref","is-referenced-by-count":0,"title":["An NP-Completeness Result of Edge Search in Graphs"],"prefix":"10.1007","volume":"30","author":[{"given":"Tatjana","family":"Gerzen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,3,26]]},"reference":[{"key":"1287_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-91203-9","volume-title":"Suchprobleme","author":"R. Alswede","year":"1979","unstructured":"Alswede R., Wegener I.: Suchprobleme. Teubner, Stuttgart (1979)"},{"key":"1287_CR2","volume-title":"Combinatorial search","author":"M. Aigner","year":"1988","unstructured":"Aigner M.: Combinatorial search. Wiley, Teubner (1988)"},{"key":"1287_CR3","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/jgt.3190120106","volume":"12","author":"M. Aigner","year":"1988","unstructured":"Aigner M., Triesch E.: Searching for an edge in a graph. J. Graph Theory 12, 45\u201357 (1988)","journal-title":"J. Graph Theory"},{"key":"1287_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern graph theory","author":"B. Bollobas","year":"1998","unstructured":"Bollobas B.: Modern graph theory. Springer, Berlin (1998)"},{"key":"1287_CR5","volume-title":"Combinatorial group testing and its applications","author":"D.Z. Du","year":"1993","unstructured":"Du D.Z., Hwang F.K.: Combinatorial group testing and its applications. Word Scientific, Singapore (1993)"},{"key":"1287_CR6","volume-title":"Pooling designs and nonadaptive group testing: important tools for DNA sequencing","author":"D.Z. Du","year":"2006","unstructured":"Du D.Z., Hwang F.K.: Pooling designs and nonadaptive group testing: important tools for DNA sequencing. Word Scientific, Singapore (2006)"},{"issue":"6","key":"1287_CR7","doi-asserted-by":"crossref","first-page":"1334","DOI":"10.1016\/j.disc.2008.01.055","volume":"309","author":"T. Gerzen","year":"2009","unstructured":"Gerzen T.: Searching for an edge in a graph with restricted test sets. Discrete Math. 309(6), 1334\u20131346 (2009)","journal-title":"Discrete Math."},{"issue":"20","key":"1287_CR8","doi-asserted-by":"crossref","first-page":"5932","DOI":"10.1016\/j.disc.2009.04.013","volume":"309","author":"T. Gerzen","year":"2009","unstructured":"Gerzen T.: Edge search in graphs with restricted test sets. Discrete Math. 309(20), 5932\u20135942 (2009)","journal-title":"Discrete Math."},{"issue":"17","key":"1287_CR9","doi-asserted-by":"crossref","first-page":"20582068","DOI":"10.1016\/j.dam.2011.06.026","volume":"159","author":"T. Gerzen","year":"2011","unstructured":"Gerzen T.: On agrouptestingproblem: characterization of graphs with 2-complexity c 2 and maximum number of edges. Discrete Appl. Math. 159(17), 20582068 (2011)","journal-title":"Discrete Appl. Math."},{"key":"1287_CR10","unstructured":"Li, X.: Group testing with two defectives. In: H.P. Yap et\u00a0al.Combinatorics and Graph TheoryProceedings of the Spring School and International Conference on Combinatorics, Hefei, China, 6\u201327 April 1992, World Scientific, Singapore, pp. 229\u2013243 (1993)"},{"key":"1287_CR11","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems, Plenum Press, New York, pp. 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"1287_CR12","volume-title":"Combinatorial optimization: algorithms and complexity","author":"C.H. Papadimitriou","year":"1998","unstructured":"Papadimitriou C.H., Steiglitz K.: Combinatorial optimization: algorithms and complexity. Dover, New York (1998)"},{"key":"1287_CR13","doi-asserted-by":"crossref","unstructured":"Triesch, E.: On a search problem in graph theory, optimization-fifth French\u2013German vonference Castel Novel 1988, Lecture notes in mathematics 1405, Springer, pp. 171\u2013176 (1989)","DOI":"10.1007\/BFb0083594"},{"key":"1287_CR14","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0012-365X(94)90178-3","volume":"125","author":"E. Triesch","year":"1994","unstructured":"Triesch E.: A probabilistic upper bound for the edge identification complexity of graphs. Discrete Math. 125, 371\u2013376 (1994)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1287-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-013-1287-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1287-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,11]],"date-time":"2019-07-11T09:21:22Z","timestamp":1562836882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-013-1287-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,26]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["1287"],"URL":"https:\/\/doi.org\/10.1007\/s00373-013-1287-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,26]]}}}