{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T03:25:30Z","timestamp":1775791530082,"version":"3.50.1"},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2018,11,16]],"date-time":"2018-11-16T00:00:00Z","timestamp":1542326400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["8136?2013"],"award-info":[{"award-number":["8136?2013"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2019,1,31]]},"abstract":"<jats:p>\n            We consider the fundamental task of graph exploration. An\n            <jats:italic>n<\/jats:italic>\n            -node graph has unlabeled nodes, and all ports at any node of degree\n            <jats:italic>d<\/jats:italic>\n            are arbitrarily numbered 0,\u2026,\n            <jats:italic>d<\/jats:italic>\n            \u22121. A mobile agent, initially situated at some starting node\n            <jats:italic>v<\/jats:italic>\n            , has to visit all nodes and stop. The\n            <jats:italic>time<\/jats:italic>\n            of the exploration is the number of edge traversals. We consider the problem of how much knowledge the agent has to have\n            <jats:italic>a priori<\/jats:italic>\n            , to explore the graph in a given time, using a deterministic algorithm. Following the paradigm of\n            <jats:italic>algorithms with advice<\/jats:italic>\n            , this\n            <jats:italic>a priori<\/jats:italic>\n            information (advice) is provided to the agent by an\n            <jats:italic>oracle<\/jats:italic>\n            , in the form of a binary string, whose length is called the\n            <jats:italic>size of advice<\/jats:italic>\n            . We consider two types of oracles. The\n            <jats:italic>instance oracle<\/jats:italic>\n            knows the entire instance of the exploration problem, i.e., the port-numbered map of the graph and the starting node of the agent in this map. The\n            <jats:italic>map oracle<\/jats:italic>\n            knows the port-numbered map of the graph but does not know the starting node of the agent. What is the minimum size of advice that must be given to the agent by each of these oracles, so that the agent explores the graph in a given time?\n          <\/jats:p>\n          <jats:p>\n            We first determine the minimum size of advice to achieve exploration in polynomial time. We prove that some advice of size log log log\n            <jats:italic>n<\/jats:italic>\n            \u2212\n            <jats:italic>c<\/jats:italic>\n            , for any constant\n            <jats:italic>c<\/jats:italic>\n            , is sufficient for polynomial exploration, and that no advice of size log log log\n            <jats:italic>n<\/jats:italic>\n            \u2212\u03d5 (\n            <jats:italic>n<\/jats:italic>\n            ), where\n            <jats:italic>\u03d5<\/jats:italic>\n            is any function diverging to infinity, can help to do this. These results hold both for the instance and for the map oracles.\n          <\/jats:p>\n          <jats:p>\n            On the other side of the spectrum, when advice is large, there are two natural time thresholds: \u0398 (\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>2<\/jats:sup>\n            ) for a map oracle, and \u0398 (\n            <jats:italic>n<\/jats:italic>\n            ) for an instance oracle. This is because, in both cases, these time benchmarks can be achieved with sufficiently large advice (advice of size\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            log\n            <jats:italic>n<\/jats:italic>\n            ) suffices). We show that, with a map oracle, time \u0398 (\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>2<\/jats:sup>\n            ) cannot be improved in general, regardless of the size of advice. What is then the smallest advice to achieve time \u0398 (\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>2<\/jats:sup>\n            ) with a map oracle? We show that this smallest size of advice is larger than\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>\u03b4<\/jats:sup>\n            , for any \u03b4 &lt; 1\/3.\n          <\/jats:p>\n          <jats:p>\n            For large advice, the situation changes significantly when we allow an instance oracle instead of a map oracle. In this case, advice of size\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            log\n            <jats:italic>n<\/jats:italic>\n            ) is enough to achieve time\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            ). Is such a large advice needed to achieve linear time? We answer this question affirmatively. Indeed, we show more: with any advice of size\n            <jats:italic>o<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            log\n            <jats:italic>n<\/jats:italic>\n            ), the time of exploration must be at least\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>\u03f5<\/jats:sup>\n            , for any \u03f5 &lt; 2, and with any advice of size\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            ), the time must be \u03a9(\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>2<\/jats:sup>\n            ).\n          <\/jats:p>\n          <jats:p>\n            We finally look at Hamiltonian graphs, as for them it is possible to achieve the absolutely optimal exploration time\n            <jats:italic>n<\/jats:italic>\n            \u22121, when sufficiently large advice (of size\n            <jats:italic>o<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            log\n            <jats:italic>n<\/jats:italic>\n            )) is given by an instance oracle. We show that a map oracle cannot achieve this: regardless of the size of advice, the time of exploration must be \u03a9(\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>2<\/jats:sup>\n            ), for some Hamiltonian graphs. However, even for the instance oracle, with advice of size\n            <jats:italic>o<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            log\n            <jats:italic>n<\/jats:italic>\n            ), optimal time\n            <jats:italic>n<\/jats:italic>\n            \u22121 cannot be achieved: Indeed, we show that the time of exploration with such advice must sometimes exceed the optimal time\n            <jats:italic>n<\/jats:italic>\n            \u22121 by a summand\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>\u03f5<\/jats:sup>\n            , for any \u03f5 &lt; 1.\n          <\/jats:p>","DOI":"10.1145\/3280823","type":"journal-article","created":{"date-parts":[[2018,11,16]],"date-time":"2018-11-16T13:08:54Z","timestamp":1542373734000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Deterministic Graph Exploration with Advice"],"prefix":"10.1145","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2296-3222","authenticated-orcid":false,"given":"Barun","family":"Gorain","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Bhilai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[{"name":"D\u00e9partement d\u2019informatique, Universit\u00e9 du Qu\u00e9bec en Outaouais, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703437211"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979732428X"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1979.34"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1999.2795"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1039"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.3081"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365703"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00993411"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791194931"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(92)90046-L"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3056461"},{"key":"e_1_2_1_12_1","volume-title":"Proceeedings of the 14th International Conference on Principles of Distributed Systems (OPODIS\u201910)","author":"Chalopin J.","unstructured":"J. Chalopin , S. Das , and A. Kosowski . 2010. Constructing a map of an anonymous graph: Applications of universal sequences . In Proceeedings of the 14th International Conference on Principles of Distributed Systems (OPODIS\u201910) . 119--134. J. Chalopin, S. Das, and A. Kosowski. 2010. Constructing a map of an anonymous graph: Applications of universal sequences. In Proceeedings of the 14th International Conference on Principles of Distributed Systems (OPODIS\u201910). 119--134."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/274787.274788"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2011.10.004"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.10.002"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087563"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31104-8_23"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159892.1159897"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.08.007"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-008-0076-y"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2009.07.002"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2008.07.005"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-010-9280-9"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 21st Symposium on Theoretical Aspects of Computer Science (STACS\u201904)","author":"Fraigniaud P.","unstructured":"P. Fraigniaud and D. Ilcinkas . 2004. Directed graphs exploration with little memory . In Proceedings of the 21st Symposium on Theoretical Aspects of Computer Science (STACS\u201904) . 246--257. P. Fraigniaud and D. Ilcinkas. 2004. Directed graphs exploration with little memory. In Proceedings of the 21st Symposium on Theoretical Aspects of Computer Science (STACS\u201904). 246--257."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/3118756.3119007"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2016.01.005"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.05.002"},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201916)","author":"Glacet C.","unstructured":"C. Glacet , A. Miller , and A. Pelc . 2016. Time vs. information tradeoffs for leader election in anonymous trees . In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201916) . 600--609. C. Glacet, A. Miller, and A. Pelc. 2016. Time vs. information tradeoffs for leader election in anonymous trees. In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201916). 600--609."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.01.004"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25258-2_23"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-010-0095-3"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.06.034"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.08.020"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1043"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2000.1625"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054114500129"},{"key":"e_1_2_1_37_1","volume-title":"Oak Ridge National Laboratory","author":"Rao N. S. V.","year":"1993","unstructured":"N. S. V. Rao , S. Kareti , W. Shi , and S. S. Iyengar . 1993. Robot navigation in unknown terrains: Introductory survey of non-heuristic algorithms. Tech. Report ORNL\/TM-12410 , Oak Ridge National Laboratory , July 1993 . N. S. V. Rao, S. Kareti, W. Shi, and S. S. Iyengar. 1993. Robot navigation in unknown terrains: Introductory survey of non-heuristic algorithms. Tech. Report ORNL\/TM-12410, Oak Ridge National Laboratory, July 1993."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391289.1391291"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3280823","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3280823","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:01:51Z","timestamp":1750208511000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3280823"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,16]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1,31]]}},"alternative-id":["10.1145\/3280823"],"URL":"https:\/\/doi.org\/10.1145\/3280823","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"value":"1549-6325","type":"print"},{"value":"1549-6333","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,16]]},"assertion":[{"value":"2017-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-11-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}