{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T20:28:09Z","timestamp":1775248089254,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T00:00:00Z","timestamp":1669680000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T00:00:00Z","timestamp":1669680000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s00607-022-01136-8","type":"journal-article","created":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T06:15:27Z","timestamp":1669788927000},"page":"483-506","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Edge exploration of anonymous graph by mobile agent with external help"],"prefix":"10.1007","volume":"105","author":[{"given":"Amit Kumar","family":"Dhar","sequence":"first","affiliation":[]},{"given":"Barun","family":"Gorain","sequence":"additional","affiliation":[]},{"given":"Kaushik","family":"Mondal","sequence":"additional","affiliation":[]},{"given":"Shaswati","family":"Patra","sequence":"additional","affiliation":[]},{"given":"Rishi Ranjan","family":"Singh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,29]]},"reference":[{"key":"1136_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1006\/inco.1999.2795","volume":"152","author":"B Awerbuch","year":"1999","unstructured":"Awerbuch B, Betke M, Ronald L, Rivest M. Singh (1999) Piecemeal graph exploration by a mobile robot. Inf Comput 152:155\u2013172","journal-title":"Inf Comput"},{"key":"1136_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2001.3081","volume":"176","author":"MA Bender","year":"2002","unstructured":"Bender MA, Fern\u00e1ndez A, Ron D, Sahai A, Vadhan SP (2002) The power of a pebble: exploring and mapping directed graphs. Inf Comput 176:1\u201321","journal-title":"Inf Comput"},{"key":"1136_CR3","unstructured":"Bender MA, Slonim D (1994) The power of team exploration: two robots can learn unlabeled directed graphs. In: Proceedings of the 35th annual symposium on foundations of computer science (FOCS 1994), pp 75\u201385"},{"key":"1136_CR4","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/0022-0000(92)90046-L","volume":"45","author":"A Borodin","year":"1992","unstructured":"Borodin A, Ruzzo W, Tompa M (1992) Lower bounds on the length of universal traversal sequences. J Comput Syst Sci 45:180\u2013203","journal-title":"J Comput Syst Sci"},{"issue":"2","key":"1136_CR5","first-page":"19:1","volume":"50","author":"J Boyar","year":"2017","unstructured":"Boyar J, Favrholdt LM, Kudahl C, Larsen KS, Mikkelsen JW (2017) Online algorithms with advice: a survey. ACM Comput Surv 50(2):19:1-19:34","journal-title":"ACM Comput Surv"},{"key":"1136_CR6","doi-asserted-by":"crossref","unstructured":"Chalopin J, Das S, Kosowski A (2010) Constructing a map of an anonymous graph: applications of universal sequences. In: Proceedings of the 14th international conference on principles of distributed systems (OPODIS 2010), pp 119\u2013134","DOI":"10.1007\/978-3-642-17653-1_10"},{"key":"1136_CR7","doi-asserted-by":"crossref","unstructured":"Cohen R, Fraigniaud P, Ilcinkas D, Korman A, Peleg D (2008) Label-guided graph exploration by a finite automaton. ACM Trans Algorithms","DOI":"10.1145\/1383369.1383373"},{"key":"1136_CR8","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.jalgor.2003.10.002","volume":"51","author":"K Diks","year":"2004","unstructured":"Diks K, Fraigniaud P, Kranakis E, Pelc A (2004) Tree exploration with little memory. J Algorithms 51:38\u201363","journal-title":"J Algorithms"},{"key":"1136_CR9","doi-asserted-by":"crossref","unstructured":"Dobrev S, Kralovic R, Markou E (2012) Online graph exploration with advice. In: Proceedings of the 19th international colloquium on structural information and communication complexity (SIROCCO 2012), pp 267\u2013278","DOI":"10.1007\/978-3-642-31104-8_23"},{"key":"1136_CR10","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1145\/1159892.1159897","volume":"2","author":"CA Duncan","year":"2006","unstructured":"Duncan CA, Kobourov SG, Anil Kumar VS (2006) Optimal constrained graph exploration. ACM Trans Algorithms 2:380\u2013402","journal-title":"ACM Trans Algorithms"},{"key":"1136_CR11","doi-asserted-by":"crossref","unstructured":"Ellen F, Gorain B, Miller A, Pelc A (2019) Constant-length labeling schemes for deterministic radio broadcast. In: Proceedings of the 31st ACM symposium on parallelism in algorithms and architectures (SPAA) 2019, pp 171\u2013178","DOI":"10.1145\/3323165.3323194"},{"key":"1136_CR12","doi-asserted-by":"publisher","first-page":"2642","DOI":"10.1016\/j.tcs.2010.08.007","volume":"412","author":"Y Emek","year":"2011","unstructured":"Emek Y, Fraigniaud P, Korman A, Rosen A (2011) Online computation with advice. Theoret Comput Sci 412:2642\u20132656","journal-title":"Theoret Comput Sci"},{"key":"1136_CR13","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s00446-008-0076-y","volume":"21","author":"P Fraigniaud","year":"2009","unstructured":"Fraigniaud P, Gavoille C, Ilcinkas D, Pelc A (2009) Distributed computing with advice: Information sensitivity of graph coloring. Distrib Comput 21:395\u2013403","journal-title":"Distrib Comput"},{"key":"1136_CR14","doi-asserted-by":"crossref","unstructured":"Fraigniaud P, Ilcinkas D, Pelc A (2010) Communication algorithms with advice. J Comput Syst Sci 76:222\u2013232","DOI":"10.1016\/j.jcss.2009.07.002"},{"key":"1136_CR15","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1016\/j.ic.2008.07.005","volume":"206","author":"P Fraigniaud","year":"2008","unstructured":"Fraigniaud P, Ilcinkas D, Pelc A (2008) Tree exploration with advice. Inf Comput 206:1276\u20131287","journal-title":"Inf Comput"},{"key":"1136_CR16","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1007\/s00224-010-9280-9","volume":"47","author":"P Fraigniaud","year":"2010","unstructured":"Fraigniaud P, Korman A, Lebhar E (2010) Local MST computation with short advice. Theory Comput Syst 47:920\u2013933","journal-title":"Theory Comput Syst"},{"key":"1136_CR17","doi-asserted-by":"crossref","unstructured":"Fraigniaud P, Ilcinkas D (2004) Directed graphs exploration with little memory. In: Proceedings of the 21st symposium on theoretical aspects of computer science (STACS 2004), pp 246\u2013257","DOI":"10.1007\/978-3-540-24749-4_22"},{"key":"1136_CR18","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/s00453-009-9361-9","volume":"60","author":"E Fusco","year":"2011","unstructured":"Fusco E, Pelc A (2011) Trade-offs between the size of advice and broadcasting time in trees. Algorithmica 60:719\u2013734","journal-title":"Algorithmica"},{"key":"1136_CR19","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/j.ic.2016.01.005","volume":"247","author":"E Fusco","year":"2016","unstructured":"Fusco E, Pelc A, Petreschi R (2016) Topology recognition with advice. Inf Comput 247:254\u2013265","journal-title":"Inf Comput"},{"key":"1136_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jalgor.2004.05.002","volume":"53","author":"C Gavoille","year":"2004","unstructured":"Gavoille C, Peleg D, P\u00e9rennes S, Raz R (2004) Distance labeling in graphs. J Algorithms 53:85\u2013112","journal-title":"J Algorithms"},{"key":"1136_CR21","first-page":"8:1","volume":"15","author":"B Gorain","year":"2018","unstructured":"Gorain B, Pelc A (2018) Deterministic graph exploration with advice. ACM Trans Algorithms 15:8:1-8:17","journal-title":"ACM Trans Algorithms"},{"key":"1136_CR22","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tcs.2021.02.008","volume":"861","author":"B Gorain","year":"2021","unstructured":"Gorain B, Pelc A (2021) Short labeling schemes for topology recognition in wireless tree networks. Theor Comput Sci 861:23\u201344","journal-title":"Theor Comput Sci"},{"key":"1136_CR23","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.tcs.2021.02.004","volume":"864","author":"B Gorain","year":"2021","unstructured":"Gorain B, Pelc A (2021) Finding the size and the diameter of a radio network using short labels. Theor Comput Sci 864:20\u201333","journal-title":"Theor Comput Sci"},{"key":"1136_CR24","doi-asserted-by":"publisher","first-page":"1544","DOI":"10.1016\/j.tcs.2010.01.004","volume":"411","author":"D Ilcinkas","year":"2012","unstructured":"Ilcinkas D, Kowalski D, Pelc A (2012) Fast radio broadcasting with advice. Theor Comput Sci 411:1544\u20131557","journal-title":"Theor Comput Sci"},{"key":"1136_CR25","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s00446-010-0095-3","volume":"22","author":"A Korman","year":"2010","unstructured":"Korman A, Kutten S, Peleg D (2010) Proof labeling schemes. Distrib Comput 22:215\u2013233","journal-title":"Distrib Comput"},{"key":"1136_CR26","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.tcs.2012.06.034","volume":"463","author":"N Megow","year":"2012","unstructured":"Megow N, Mehlhorn K, Schweitzer P (2012) Online graph exploration: new results on old and new algorithms. Theoret Comput Sci 463:62\u201372","journal-title":"Theoret Comput Sci"},{"key":"1136_CR27","doi-asserted-by":"publisher","first-page":"1307","DOI":"10.1016\/j.tcs.2008.08.020","volume":"410","author":"N Nisse","year":"2009","unstructured":"Nisse N, Soguet D (2009) Graph searching with advice. Theor Comput Sci 410:1307\u20131318","journal-title":"Theor Comput Sci"},{"key":"1136_CR28","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1142\/S0129054114500129","volume":"25","author":"A Pelc","year":"2014","unstructured":"Pelc A, Tiane A (2014) Efficient grid exploration with a stationary token. Int J Found Comput Sci 25:247\u2013262","journal-title":"Int J Found Comput Sci"},{"key":"1136_CR29","doi-asserted-by":"crossref","unstructured":"Rao NSV, Kareti S, Shi W, Iyengar SS (1993) Robot navigation in unknown terrains: introductory survey of non-heuristic algorithms. Technical report ORNL\/TM-12410, Oak Ridge National Laboratory","DOI":"10.2172\/10180101"},{"key":"1136_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1391289.1391291","volume":"55","author":"O Reingold","year":"2008","unstructured":"Reingold O (2008) Undirected connectivity in log-space. J ACM 55:1\u201324","journal-title":"J ACM"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-022-01136-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-022-01136-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-022-01136-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T16:18:05Z","timestamp":1675181885000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-022-01136-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,29]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["1136"],"URL":"https:\/\/doi.org\/10.1007\/s00607-022-01136-8","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,29]]},"assertion":[{"value":"4 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}