{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T13:40:26Z","timestamp":1726062026434},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030364113"},{"type":"electronic","value":"9783030364120"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-36412-0_12","type":"book-chapter","created":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T19:04:15Z","timestamp":1575572655000},"page":"142-154","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Edge Exploration of a Graph by Mobile Agent"],"prefix":"10.1007","author":[{"given":"Amit Kumar","family":"Dhar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barun","family":"Gorain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaushik","family":"Mondal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaswati","family":"Patra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rishi Ranjan","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,23]]},"reference":[{"key":"12_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., Rivest, R.L., Singh, M.: Piecemeal graph exploration by a mobile robot. Inf. Comput. 152, 155\u2013172 (1999)","journal-title":"Inf. Comput."},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2001.3081","volume":"176","author":"MA Bender","year":"2002","unstructured":"Bender, M.A., Fern\u00e1ndez, A., Ron, D., Sahai, A., Vadhan, S.P.: The power of a pebble: exploring and mapping directed graphs. Inf. Comput. 176, 1\u201321 (2002)","journal-title":"Inf. Comput."},{"key":"12_CR3","unstructured":"Bender, M.A., Slonim, D.: The power of team exploration: two robots can learn unlabeled directed graphs. In: Proceedings of 35th Annual Symposium on Foundations of Computer Science (FOCS 1994), pp. 75\u201385 (1994)"},{"key":"12_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.: Lower bounds on the length of universal traversal sequences. J. Comput. Syst. Sci. 45, 180\u2013203 (1992)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"19:1","DOI":"10.1145\/3056461","volume":"50","author":"J Boyar","year":"2017","unstructured":"Boyar, J., Favrholdt, L.M., Kudahl, C., Larsen, K.S., Mikkelsen, J.W.: Online algorithms with advice: a survey. ACM Comput. Surv. 50(2), 19:1\u201319:34 (2017)","journal-title":"ACM Comput. Surv."},{"key":"12_CR6","first-page":"119","volume-title":"Lecture Notes in Computer Science","author":"J\u00e9r\u00e9mie Chalopin","year":"2010","unstructured":"Chalopin, J., Das, S., Kosowski, A.: Constructing a map of an anonymous graph: applications of universal sequences. In: Proceedings of 14th International Conference on Principles of Distributed Systems (OPODIS 2010), pp. 119\u2013134 (2010)"},{"key":"12_CR7","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.: Tree exploration with little memory. J. Algorithms 51, 38\u201363 (2004)","journal-title":"J. Algorithms"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-31104-8_23","volume-title":"Structural Information and Communication Complexity","author":"Stefan Dobrev","year":"2012","unstructured":"Dobrev, S., Kralovic, R., Markou, E.: Online graph exploration with advice. In: Proceedings of 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2012), pp. 267\u2013278 (2012)"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1145\/1159892.1159897","volume":"2","author":"CA Duncan","year":"2006","unstructured":"Duncan, C.A., Kobourov, S.G., Anil Kumar, V.S.: Optimal constrained graph exploration. ACM Trans. Algorithms 2, 380\u2013402 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Ellen, F., Gorain, B., Miller, A., Pelc, A.: Constant-length labeling schemes for deterministic radio broadcast. In: Proceedings of 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 171\u2013178 (2019)","DOI":"10.1145\/3323165.3323194"},{"key":"12_CR11","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.: Online computation with advice. Theor. Comput. Sci. 412, 2642\u20132656 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR12","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.: Distributed computing with advice: information sensitivity of graph coloring. Distrib. Comput. 21, 395\u2013403 (2009)","journal-title":"Distrib. Comput."},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.jcss.2009.07.002","volume":"76","author":"P Fraigniaud","year":"2010","unstructured":"Fraigniaud, P., Ilcinkas, D., Pelc, A.: Communication algorithms with advice. J. Comput. Syst. Sci. 76, 222\u2013232 (2010). Oracle size: a new measure of difficulty for communication problems. In: Proceedings of 25th Annual ACM Symposium on Principles of Distributed Computing (PODC 2006), pp. 179\u2013187","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR14","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.: Tree exploration with advice. Inf. Comput. 206, 1276\u20131287 (2008)","journal-title":"Inf. Comput."},{"key":"12_CR15","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.: Local MST computation with short advice. Theory Comput. Syst. 47, 920\u2013933 (2010)","journal-title":"Theory Comput. Syst."},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Ilcinkas, D.: Directed graphs exploration with little memory. In: Proceedings of 21st Symposium on Theoretical Aspects of Computer Science (STACS 2004), pp. 246\u2013257 (2004)","DOI":"10.1007\/978-3-540-24749-4_22"},{"key":"12_CR17","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.: Trade-offs between the size of advice and broadcasting time in trees. Algorithmica 60, 719\u2013734 (2011)","journal-title":"Algorithmica"},{"key":"12_CR18","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.: Topology recognition with advice. Inf. Comput. 247, 254\u2013265 (2016)","journal-title":"Inf. Comput."},{"key":"12_CR19","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.: Distance labeling in graphs. J. Algorithms 53, 85\u2013112 (2004)","journal-title":"J. Algorithms"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Glacet, C., Miller, A., Pelc, A.: Time vs. information tradeoffs for leader election in anonymous trees. In: Proceedings of 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), pp. 600\u2013609 (2016)","DOI":"10.1137\/1.9781611974331.ch44"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"8:1","DOI":"10.1145\/3280823","volume":"15","author":"B Gorain","year":"2018","unstructured":"Gorain, B., Pelc, A.: Deterministic graph exploration with advice. ACM Trans. Algorithms 15, 8:1\u20138:17 (2018)","journal-title":"ACM Trans. Algorithms"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-319-72050-0_3","volume-title":"Structural Information and Communication Complexity","author":"Barun Gorain","year":"2017","unstructured":"Gorain, B., Pelc, A.: Short labeling schemes for topology recognition in wireless tree networks. In: Proceedings of 24th International Colloquium Structural Information and Communication Complexity (SIROCCO), pp. 37\u201352 (2017)"},{"key":"12_CR23","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.: Fast radio broadcasting with advice. Theor. Comput. Sci. 411, 1544\u20131557 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR24","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.: Proof labeling schemes. Distrib. Comput. 22, 215\u2013233 (2010)","journal-title":"Distrib. Comput."},{"key":"12_CR25","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.: Online graph exploration: new results on old and new algorithms. Theor. Comput. Sci. 463, 62\u201372 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR26","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.: Graph searching with advice. Theoret. Comput. Sci. 410, 1307\u20131318 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1142\/S0129054114500129","volume":"25","author":"A Pelc","year":"2014","unstructured":"Pelc, A., Tiane, A.: Efficient grid exploration with a stationary token. Int. J. Found. Comput. Sci. 25, 247\u2013262 (2014)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Rao, N.S.V., Kareti, S., Shi, W., Iyengar, S.S.: Robot navigation in unknown terrains: introductory survey of non-heuristic algorithms. Technical Report ORNL\/TM-12410, Oak Ridge National Laboratory, July 1993","DOI":"10.2172\/10180101"},{"key":"12_CR29","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/1391289.1391291","volume":"55","author":"O Reingold","year":"2008","unstructured":"Reingold, O.: Undirected connectivity in log-space. J. ACM 55, 17 (2008)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36412-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T19:10:19Z","timestamp":1575573019000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36412-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030364113","9783030364120"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36412-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xiamen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoaconference.org\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"108","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}