乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:43:39Z","timestamp":1720201419539},"reference-count":37,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2013,2,1]],"date-time":"2013-02-01T00:00:00Z","timestamp":1359676800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,2,11]],"date-time":"2017-02-11T00:00:00Z","timestamp":1486771200000},"content-version":"vor","delay-in-days":1471,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1016\/j.tcs.2012.11.022","type":"journal-article","created":{"date-parts":[[2012,12,4]],"date-time":"2012-12-04T17:44:10Z","timestamp":1354643050000},"page":"28-45","source":"Crossref","is-referenced-by-count":20,"special_numbering":"C","title":["Exploring an unknown dangerous graph using tokens"],"prefix":"10.1016","volume":"472","author":[{"given":"Stefan","family":"Dobrev","sequence":"first","affiliation":[]},{"given":"Paola","family":"Flocchini","sequence":"additional","affiliation":[]},{"given":"Rastislav","family":"Kr\u00e1lovi\u010d","sequence":"additional","affiliation":[]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2012.11.022_br000005","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0166-218X(95)00054-U","article-title":"A heuristic with worst-case analysis for minimax routing of two traveling salesmen on a tree","volume":"68","author":"Averbakh","year":"1996","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.tcs.2012.11.022_br000010","doi-asserted-by":"crossref","unstructured":"B. Balamohan, S. Dobrev, P. Flocchini, N. Santoro, Asynchronous black hole search in an unknown anonymous graph with O(1) pebbles, in: Proceedings of 19th International Colloquium on Structural Information and Communication Complexity, SIROCCO, 2012.","DOI":"10.1007\/978-3-642-31104-8_24"},{"key":"10.1016\/j.tcs.2012.11.022_br000015","doi-asserted-by":"crossref","unstructured":"B. Balamohan, P. Flocchini, A. Miri, N. Santoro, Improving the optimal bounds for black hole search in rings, in: Proceedings of 18th International Colloquium on Structural Information and Communication Complexity, SIROCCO, 2011, pp. 198\u2013209.","DOI":"10.1007\/978-3-642-22212-2_18"},{"issue":"1","key":"10.1016\/j.tcs.2012.11.022_br000020","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.2001.3081","article-title":"The power of a pebble: exploring and mapping directed graphs","volume":"176","author":"Bender","year":"2002","journal-title":"Information and Computation"},{"key":"10.1016\/j.tcs.2012.11.022_br000025","doi-asserted-by":"crossref","unstructured":"M. Bender, D.K. Slonim, The power of team exploration: two robots can learn unlabeled directed graphs, in: Proceedings of 35th IEEE Symposium on Foundations of Computer Science, FOCS, 1994, pp. 75\u201385.","DOI":"10.1109\/SFCS.1994.365703"},{"key":"10.1016\/j.tcs.2012.11.022_br000030","doi-asserted-by":"crossref","unstructured":"M. Blum, D. Kozen, On the power of the compass (or, why mazes are easier to search than graphs), in: Proceedings of 19th IEEE Symposium on Foundations of Computer Science, FOCS, 1978, pp. 132\u2013142.","DOI":"10.1109\/SFCS.1978.30"},{"key":"10.1016\/j.tcs.2012.11.022_br000035","series-title":"Mobile Agents in Networking and Distributed Computing","year":"2010"},{"key":"10.1016\/j.tcs.2012.11.022_br000040","doi-asserted-by":"crossref","unstructured":"J. Chalopin, S. Das, A. Labourel, E. Markou, Black hole search with finite automata scattered in a synchronous torus, in: Proceedings of 25th International Symposium on Distributed Computing, DISC, 2011, pp. 432\u2013446.","DOI":"10.1007\/978-3-642-24100-0_41"},{"key":"10.1016\/j.tcs.2012.11.022_br000045","doi-asserted-by":"crossref","unstructured":"J. Chalopin, S. Das, A. Labourel, E. Markou, Tight bounds for scattered black hole search in a ring, in: Proceedings of 18th International Colloquium on Structural Information and Communication Complexity, SIROCCO, 2011, pp. 186\u2013197.","DOI":"10.1007\/978-3-642-22212-2_17"},{"key":"10.1016\/j.tcs.2012.11.022_br000050","doi-asserted-by":"crossref","unstructured":"C. Cooper, R. Klasing, T. Radzik, Searching for black-hole faults in a network using multiple agents, in: Proceedings of 10th International Conference on Principles of Distributed Systems, OPODIS, 2006, pp. 320\u2013332.","DOI":"10.1007\/11945529_23"},{"key":"10.1016\/j.tcs.2012.11.022_br000055","doi-asserted-by":"crossref","unstructured":"J. Czyzowicz, S. Dobrev, R. Kr\u00e1lovic, S. Mikl\u00edk, D. Pardubsk\u00e1, Black hole search in directed graphs, in: Proceedings of 16th International Colloquium on Structural Information and Communication Complexity, SIROCCO, 2009, pp. 182\u2013194.","DOI":"10.1007\/978-3-642-11476-2_15"},{"issue":"2\u20133","key":"10.1016\/j.tcs.2012.11.022_br000060","first-page":"229","article-title":"Complexity of searching for a black hole","volume":"71","author":"Czyzowicz","year":"2006","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/j.tcs.2012.11.022_br000065","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":"Combinatorics, Probability & Computing"},{"issue":"1\u20133","key":"10.1016\/j.tcs.2012.11.022_br000070","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":"Theoretical Computer Science"},{"issue":"3","key":"10.1016\/j.tcs.2012.11.022_br000075","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":"Journal of Graph Theory"},{"issue":"2","key":"10.1016\/j.tcs.2012.11.022_br000080","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/net.20095","article-title":"Optimal search for a black hole in common interconnection networks","volume":"47","author":"Dobrev","year":"2006","journal-title":"Networks"},{"key":"10.1016\/j.tcs.2012.11.022_br000085","doi-asserted-by":"crossref","unstructured":"S. Dobrev, P. Flocchini, R. Kr\u00e1lovic, N. Santoro, Exploring an unknown graph to locate a black hole using tokens, in: Proceedings of 5th IFIP International Conference on Theoretical Computer Science, TCS, 2006, pp. 131\u2013150.","DOI":"10.1007\/978-0-387-34735-6_14"},{"issue":"1","key":"10.1016\/j.tcs.2012.11.022_br000090","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 protocol","volume":"19","author":"Dobrev","year":"2006","journal-title":"Distributed Computing"},{"key":"10.1016\/j.tcs.2012.11.022_br000095","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"},{"key":"10.1016\/j.tcs.2012.11.022_br000100","doi-asserted-by":"crossref","unstructured":"S. Dobrev, P. Flocchini, N. Santoro, Improved bounds for optimal black hole search in a network with a map, in: Proceedings of 10th International Colloquium on Structural Information and Communication Complexity, SIROCCO, 2004, pp. 111\u2013122.","DOI":"10.1007\/978-3-540-27796-5_11"},{"key":"10.1016\/j.tcs.2012.11.022_br000105","doi-asserted-by":"crossref","unstructured":"S. Dobrev, R. Kr\u00e1lovic, N. Santoro, W. Shi, Black hole search in asynchronous rings using tokens, in: Proceedings of 6th International Conference on Algorithms and Complexity, CIAC, 2006, pp. 139\u2013150.","DOI":"10.1007\/11758471_16"},{"issue":"6","key":"10.1016\/j.tcs.2012.11.022_br000110","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":"International Journal on Foundations of Computer Science"},{"issue":"6","key":"10.1016\/j.tcs.2012.11.022_br000115","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1109\/70.105395","article-title":"Robotic exploration as graph construction","volume":"7","author":"Dudek","year":"1991","journal-title":"Transactions on Robotics and Automation"},{"issue":"3\u20134","key":"10.1016\/j.tcs.2012.11.022_br000120","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.2012.11.022_br000125","doi-asserted-by":"crossref","unstructured":"P. Flocchini, M. Kellett, P. Mason, N. Santoro, Map construction and exploration by mobile agents scattered in a dangerous network, in: Proceedings of 24th IEEE International Parallel and Distributed Processing Symposium, IPDPS, 2009, pp. 1\u201310.","DOI":"10.1109\/IPDPS.2009.5161080"},{"issue":"3","key":"10.1016\/j.tcs.2012.11.022_br000130","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"},{"key":"10.1016\/j.tcs.2012.11.022_br000135","doi-asserted-by":"crossref","unstructured":"P. Fraigniaud, D. Ilcinkas, Digraph exploration with little memory, in: Proceedings of 21st Symp. on Theoretical Aspects of Computer Science, STACS, 2004, pp. 246\u2013257.","DOI":"10.1007\/978-3-540-24749-4_22"},{"issue":"2\u20133","key":"10.1016\/j.tcs.2012.11.022_br000140","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":"Theoretical Computer Science"},{"key":"10.1016\/j.tcs.2012.11.022_br000145","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/0207017","article-title":"Approximation algorithms for some routing problems","volume":"7","author":"Frederickson","year":"1978","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.tcs.2012.11.022_br000150","doi-asserted-by":"crossref","unstructured":"P. Glaus, Locating a black hole without the knowledge of incoming links, in: Proceedings of 5th International Workshop on Algorithmic Aspects of Wireless Sensor Networks, ALGOSENSOR, 2009, pp. 128\u2013138.","DOI":"10.1007\/978-3-642-05434-1_13"},{"issue":"2\u20133","key":"10.1016\/j.tcs.2012.11.022_br000155","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":"Theoretical Computer Science"},{"issue":"4","key":"10.1016\/j.tcs.2012.11.022_br000160","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.2012.11.022_br000165","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":"Theoretical Computer Science"},{"key":"10.1016\/j.tcs.2012.11.022_br000170","doi-asserted-by":"crossref","unstructured":"R. Kr\u00e1lovic, S. Mikl\u00edk, Periodic data retrieval problem in rings containing a malicious host, in: Proceedings of 17th International Colloquium on Structural Information and Communication Complexity, SIROCCO, 2010, pp. 157\u2013167.","DOI":"10.1007\/978-3-642-13284-1_13"},{"key":"10.1016\/j.tcs.2012.11.022_br000175","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.2012.11.022_br000180","unstructured":"C.E. Shannon, Presentation of a maze-solving machine, in: Proceedings of 8th Conference of the Josiah Macy Jr. Foundation (Cybernetics), 1951, pp. 173\u2013180."},{"key":"10.1016\/j.tcs.2012.11.022_br000185","doi-asserted-by":"crossref","unstructured":"W. Shi, Black hole search with tokens in interconnected networks, in: Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS, 2009, pp. 670\u2013682.","DOI":"10.1007\/978-3-642-05118-0_46"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397512010523?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397512010523?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,7,6]],"date-time":"2019-07-06T15:34:37Z","timestamp":1562427277000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397512010523"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2]]},"references-count":37,"alternative-id":["S0304397512010523"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2012.11.022","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2013,2]]}}}