{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:43:51Z","timestamp":1720201431727},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,12,6]],"date-time":"2020-12-06T00:00:00Z","timestamp":1607212800000},"content-version":"vor","delay-in-days":1466,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1016\/j.tcs.2016.09.027","type":"journal-article","created":{"date-parts":[[2016,10,18]],"date-time":"2016-10-18T20:50:15Z","timestamp":1476823815000},"page":"41-57","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"PA","title":["More agents may decrease global work: A case in butterfly decontamination"],"prefix":"10.1016","volume":"655","author":[{"given":"Fabrizio","family":"Luccio","sequence":"first","affiliation":[]},{"given":"Linda","family":"Pagli","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2016.09.027_br0010","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ic.2012.08.004","article-title":"Connected graph searching","volume":"219","author":"Barriere","year":"2012","journal-title":"Inform. and Comput."},{"key":"10.1016\/j.tcs.2016.09.027_br0020","series-title":"Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science WG 2003","first-page":"34","article-title":"Searching is not jumping","author":"Barriere","year":"2003"},{"issue":"4","key":"10.1016\/j.tcs.2016.09.027_br0030","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(94)00087-5","article-title":"Two edge-disjoint hamiltonian cycles in the butterfly graph","volume":"51","author":"Barth","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.tcs.2016.09.027_br0040","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0196-6774(91)90003-H","article-title":"Monotonicity in graph searching","volume":"12","author":"Bienstock","year":"1991","journal-title":"J. Algorithms"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2016.09.027_br0050","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.tcs.2008.02.004","article-title":"Distributed chasing of network intruders","volume":"339","author":"Blin","year":"2008","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2016.09.027_br0060","doi-asserted-by":"crossref","first-page":"151","DOI":"10.15803\/ijnc.4.1_151","article-title":"Decontaminating a network from a black virus","volume":"4","author":"Cai","year":"2014","journal-title":"Int. J. Networking Comput."},{"key":"10.1016\/j.tcs.2016.09.027_br0070","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.tcs.2013.02.010","article-title":"Tight bounds for black hole search with scattered agents in synchronous rings","volume":"509","author":"Chalopin","year":"2013","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2016.09.027_br0080","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.tcs.2012.01.035","article-title":"More efficient periodic traversal in anonymous undirected graphs","volume":"444","author":"Czyzowicz","year":"2012","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/j.tcs.2016.09.027_br0090","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/net.20240","article-title":"Decontamination of hypercubes by mobile agents","volume":"52","author":"Flocchini","year":"2008","journal-title":"Networks"},{"issue":"3\u20134","key":"10.1016\/j.tcs.2016.09.027_br0100","doi-asserted-by":"crossref","first-page":"1006","DOI":"10.1007\/s00453-011-9496-3","article-title":"Ping pong in dangerous graphs: optimal black hole search with pebbles","volume":"62","author":"Flocchini","year":"2012","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2016.09.027_br0110","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.dam.2015.07.020","article-title":"Network decontamination under m immunity","volume":"201","author":"Flocchini","year":"2016","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/j.tcs.2016.09.027_br0120","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","article-title":"An annotated bibliography on guaranteed graph searching","volume":"339","author":"Fomin","year":"2008","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2016.09.027_br0130","series-title":"Computer Architecture: A Quantitative Approach","author":"Hennessy","year":"2012"},{"key":"10.1016\/j.tcs.2016.09.027_br0140","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.tcs.2008.03.035","article-title":"Setting port numbers for fast graph exploration","volume":"401","author":"Ilcinkas","year":"2008","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2016.09.027_br0150","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s00446-009-0089-1","article-title":"The cost of monotonicity in distributed graph searching","volume":"22","author":"Ilcinkas","year":"2009","journal-title":"Distrib. Comput."},{"issue":"9","key":"10.1016\/j.tcs.2016.09.027_br0160","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1016\/j.jpdc.2007.04.013","article-title":"Capturing an intruder in product networks","volume":"67","author":"Imani","year":"2007","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.tcs.2016.09.027_br0170","series-title":"Handbook of Theoretical Computer Science, vol. A: Algorithms and Complexity (A)","first-page":"869","article-title":"Parallel algorithms for shared-memory machines","author":"Karp","year":"1990"},{"issue":"4","key":"10.1016\/j.tcs.2016.09.027_br0180","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.20233","article-title":"Approximation bounds for black hole search problems","volume":"52","author":"Klasing","year":"2008","journal-title":"Networks"},{"issue":"2","key":"10.1016\/j.tcs.2016.09.027_br0190","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/151261.151263","article-title":"Recontamination does not help to search a graph","volume":"40","author":"Lapaugh","year":"1993","journal-title":"J. ACM"},{"key":"10.1016\/j.tcs.2016.09.027_br0200","series-title":"Introduction to Parallel Algorithms and Architectures","author":"Leighton","year":"1992"},{"key":"10.1016\/j.tcs.2016.09.027_br0210","series-title":"Proceedings of the 23rd IEEE International Parallel and Distributed Processing Symposium IPDPS 2009","first-page":"1","article-title":"A general approach to toroidal mesh decontamination with local immunity","author":"Luccio","year":"2009"},{"key":"10.1016\/j.tcs.2016.09.027_br0220","series-title":"Proceedings of the First Heinz Nixdorf Symposium: Parallel Architectures and Their Efficient Use, 1992","first-page":"166","article-title":"Three non-conventional paradigms of parallel computation","author":"Luccio","year":"1992"},{"issue":"3","key":"10.1016\/j.tcs.2016.09.027_br0230","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1142\/S0129054107004784","article-title":"Network decontamination in presence of local immunity","volume":"18","author":"Luccio","year":"2007","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/j.tcs.2016.09.027_br0240","first-page":"93","article-title":"Identifying hostile nodes in networks using mobile agents","volume":"108","author":"Markou","year":"2012","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci. EATCS"},{"issue":"1","key":"10.1016\/j.tcs.2016.09.027_br0250","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/42267.42268","article-title":"The complexity of searching a graph","volume":"35","author":"Megiddo","year":"1998","journal-title":"J. ACM"},{"issue":"14","key":"10.1016\/j.tcs.2016.09.027_br0260","doi-asserted-by":"crossref","first-page":"1307","DOI":"10.1016\/j.tcs.2008.08.020","article-title":"Graph searching with advice","volume":"410","author":"Nisse","year":"2009","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2016.09.027_br0270","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0304-3975(01)00055-X","article-title":"Local majorities, coalitions and monopolies in graphs: a review","volume":"282","author":"Peleg","year":"2002","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2016.09.027_br0280","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jpdc.2015.10.006","article-title":"Black hole search in computer networks: state-of-the-art, challenges and future directions","volume":"88","author":"Peng","year":"2016","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.tcs.2016.09.027_br0290","series-title":"Design and Analysis of Distributed Algorithms","author":"Santoro","year":"2006"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397516305151?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397516305151?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T23:21:54Z","timestamp":1656372114000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397516305151"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":29,"alternative-id":["S0304397516305151"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2016.09.027","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2016,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"More agents may decrease global work: A case in butterfly decontamination","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2016.09.027","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}
