{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T18:42:45Z","timestamp":1726512165890},"reference-count":32,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T00:00:00Z","timestamp":1578700800000},"content-version":"vor","delay-in-days":1471,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006109","name":"VEGA","doi-asserted-by":"crossref","award":["2\/0136\/12"],"id":[{"id":"10.13039\/501100006109","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1016\/j.tcs.2014.07.013","type":"journal-article","created":{"date-parts":[[2014,7,16]],"date-time":"2014-07-16T16:00:10Z","timestamp":1405526410000},"page":"169-181","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"PB","title":["Exploring an unknown dangerous graph with a constant number of tokens"],"prefix":"10.1016","volume":"610","author":[{"given":"B.","family":"Balamohan","sequence":"first","affiliation":[]},{"given":"S.","family":"Dobrev","sequence":"additional","affiliation":[]},{"given":"P.","family":"Flocchini","sequence":"additional","affiliation":[]},{"given":"N.","family":"Santoro","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2014.07.013_br0010","doi-asserted-by":"crossref","first-page":"1164","DOI":"10.1137\/S009753979732428X","article-title":"Exploring unknown environments","volume":"29","author":"Albers","year":"2000","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/j.tcs.2014.07.013_br0020","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1142\/S1793830911001346","article-title":"Improving the optimal bounds for black hole search in rings","volume":"3","author":"Balamohan","year":"2011","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"1","key":"10.1016\/j.tcs.2014.07.013_br0030","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.2001.3081","article-title":"The power of a pebble","volume":"176","author":"Bender","year":"2002","journal-title":"Inform. and Comput."},{"year":"2012","series-title":"Mobile Agents in Networking and Distributed Computing","key":"10.1016\/j.tcs.2014.07.013_br0040"},{"key":"10.1016\/j.tcs.2014.07.013_br0050","series-title":"25th International Conference on Distributed Computing","first-page":"432","article-title":"Black hole search with finite automata scattered in a synchronous torus","author":"Chalopin","year":"2011"},{"key":"10.1016\/j.tcs.2014.07.013_br0060","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.2014.07.013_br0070","series-title":"10th International Conference on Principles of Distributed Systems","first-page":"320","article-title":"Searching for black-hole faults in a network using multiple agents","author":"Cooper","year":"2006"},{"issue":"14\u201315","key":"10.1016\/j.tcs.2014.07.013_br0080","first-page":"1638","article-title":"Locating and repairing faults in a network with mobile agents","volume":"411","author":"Cooper","year":"2011","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2014.07.013_br0090","series-title":"16th International Colloquium on Structural Information and Communication Complexity","first-page":"182","article-title":"Black hole search in directed graphs","author":"Czyzowicz","year":"2009"},{"issue":"2\u20133","key":"10.1016\/j.tcs.2014.07.013_br0100","first-page":"229","article-title":"Complexity of searching for a black hole","volume":"71","author":"Czyzowicz","year":"2006","journal-title":"Fund. Inform."},{"issue":"4","key":"10.1016\/j.tcs.2014.07.013_br0110","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1017\/S0963548306008133","article-title":"Searching for a black hole in synchronous tree networks","volume":"16","author":"Czyzowicz","year":"2007","journal-title":"Combin. Probab. Comput."},{"issue":"1\u20133","key":"10.1016\/j.tcs.2014.07.013_br0120","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.tcs.2007.05.011","article-title":"Map construction of unknown graphs by multiple agents","volume":"385","author":"Das","year":"2007","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/j.tcs.2014.07.013_br0130","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/(SICI)1097-0118(199911)32:3<265::AID-JGT6>3.0.CO;2-8","article-title":"Exploring an unknown graph","volume":"32","author":"Deng","year":"1999","journal-title":"J. Graph Theory"},{"issue":"1","key":"10.1016\/j.tcs.2014.07.013_br0140","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.jalgor.2003.10.002","article-title":"Tree exploration with little memory","volume":"51","author":"Diks","year":"2004","journal-title":"J. Algorithms"},{"issue":"2","key":"10.1016\/j.tcs.2014.07.013_br0150","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/net.20095","article-title":"Black hole search in common interconnection networks","volume":"47","author":"Dobrev","year":"2006","journal-title":"Networks"},{"key":"10.1016\/j.tcs.2014.07.013_br0160","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.tcs.2012.11.022","article-title":"Exploring an unknown dangerous graph using tokens","volume":"472","author":"Dobrev","year":"2013","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2014.07.013_br0170","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00446-006-0154-y","article-title":"Searching for a black hole in arbitrary networks: optimal mobile agents protocols","volume":"19","author":"Dobrev","year":"2006","journal-title":"Distrib. Comput."},{"key":"10.1016\/j.tcs.2014.07.013_br0180","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s00453-006-1232-z","article-title":"Mobile search for a black hole in an anonymous ring","volume":"48","author":"Dobrev","year":"2007","journal-title":"Algorithmica"},{"issue":"6","key":"10.1016\/j.tcs.2014.07.013_br0190","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1142\/S0129054108006327","article-title":"Using scattered mobile agents to locate a black hole in an un-oriented ring with tokens","volume":"19","author":"Dobrev","year":"2008","journal-title":"Internat. J. Found. Comput. Sci."},{"issue":"3\u20134","key":"10.1016\/j.tcs.2014.07.013_br0200","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.2014.07.013_br0210","series-title":"24th IEEE International Parallel and Distributed Processing Symposium","first-page":"1","article-title":"Map construction and exploration by mobile agents scattered in a dangerous network","author":"Flocchini","year":"2009"},{"issue":"1","key":"10.1016\/j.tcs.2014.07.013_br0220","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/s00224-011-9341-8","article-title":"Searching for black holes in subways","volume":"50","author":"Flocchini","year":"2012","journal-title":"Theory Comput. Syst."},{"issue":"23","key":"10.1016\/j.tcs.2014.07.013_br0230","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1002\/net.20127","article-title":"Collective tree exploration","volume":"48","author":"Fraigniaud","year":"2006","journal-title":"Networks"},{"issue":"2\u20133","key":"10.1016\/j.tcs.2014.07.013_br0240","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/j.tcs.2005.07.014","article-title":"Graph exploration by a finite automaton","volume":"345","author":"Fraigniaud","year":"2005","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2014.07.013_br0250","series-title":"5th International Workshop on Algorithmic Aspects of Wireless Sensor Networks","first-page":"128","article-title":"Locating a black hole without the knowledge of incoming link","author":"Glaus","year":"2009"},{"issue":"2\u20133","key":"10.1016\/j.tcs.2014.07.013_br0260","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.tcs.2007.04.024","article-title":"Hardness and approximation results for black hole search in arbitrary networks","volume":"384","author":"Klasing","year":"2007","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/j.tcs.2014.07.013_br0270","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":"41","key":"10.1016\/j.tcs.2014.07.013_br0280","doi-asserted-by":"crossref","first-page":"5752","DOI":"10.1016\/j.tcs.2011.05.054","article-title":"Synchronous black hole search in directed graphs","volume":"412","author":"Kosowski","year":"2011","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2014.07.013_br0290","series-title":"17th International Colloquium on Structural Information and Communication Complexity","first-page":"157","article-title":"Periodic data retrieval problem in rings containing a malicious host","author":"Kr\u00e1lovic","year":"2010"},{"key":"10.1016\/j.tcs.2014.07.013_br0300","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1006\/jagm.1999.1043","article-title":"Exploring unknown undirected graphs","volume":"33","author":"Panaite","year":"1999","journal-title":"J. Algorithms"},{"key":"10.1016\/j.tcs.2014.07.013_br0310","series-title":"8th Conf. of the Josiah Macy Jr. Found. (Cybernetics)","first-page":"173","article-title":"Presentation of a maze-solving machine","author":"Shannon","year":"1951"},{"issue":"1","key":"10.1016\/j.tcs.2014.07.013_br0320","doi-asserted-by":"crossref","first-page":"1945","DOI":"10.1016\/j.jpdc.2013.08.009","article-title":"Searching for a black hole in interconnected networks using mobile agents and tokens","volume":"74","author":"Shi","year":"2014","journal-title":"J. Parallel Distrib. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439751400543X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439751400543X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T20:20:27Z","timestamp":1578687627000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439751400543X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1]]},"references-count":32,"alternative-id":["S030439751400543X"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2014.07.013","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2016,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Exploring an unknown dangerous graph with a constant number of tokens","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2014.07.013","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}