Collision-free exploration by mobile agents using pebbles
In this paper, we study collision-free graph exploration in an anonymous network. The network is modeled as a graph G=(V,E) where the nodes of the graph are unlabeled, and each edge incident to a node v has a unique label, called the port number, in {0,1,⋯,d−1}, where d is the degree of the node v....
Uložené v:
| Vydané v: | Information and computation Ročník 307; s. 105380 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier Inc
01.11.2025
|
| Predmet: | |
| ISSN: | 0890-5401 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | In this paper, we study collision-free graph exploration in an anonymous network. The network is modeled as a graph G=(V,E) where the nodes of the graph are unlabeled, and each edge incident to a node v has a unique label, called the port number, in {0,1,⋯,d−1}, where d is the degree of the node v. Two identical mobile agents, starting from different nodes in G have to explore the nodes of G in such a way that for every node v in G, at least one mobile agent visits v and no two agents are in the same node in any round and stop. The time of exploration is the minimum round number by which both agents have terminated. The agents know the size of the graph but do not know its topology. If an agent arrives in the one-hop neighborhood of the other agent, both agents can detect the presence of the other agent but have no idea at which neighboring node the other agent resides. The agents may wake up in different rounds, but once awake, execute a deterministic algorithm in synchronous rounds. An agent, after waking up, has no knowledge about the wake-up time of the other agent.
The task of collision-free exploration is impossible to solve even for a line of length 2 where the agents are placed at the end nodes of the line and even if both agents wake up at the same time. We study the problem of collision-free exploration where some pebbles are placed by an Oracle at the nodes of the graph to assist the agents in achieving collision-free exploration. The Oracle knows the graph, the starting positions of the agents, and their wake-up schedule, and it places some pebbles that may be of different colors, at most one at each node. The number of different colors of the pebbles placed by the Oracle is called the color index of the corresponding pebble placement algorithm.
The central question we study in this paper is as follows.
“What is the minimum number z such that there exists a collision-free exploration of a given graph with pebble placement of color index z?”
For general graphs, we show that it is impossible to design a deterministic algorithm that achieves collision-free exploration with color index 1. We propose an exploration algorithm with color index 3. We also proposed a polynomial exploration algorithm for bipartite graphs with color index 1. |
|---|---|
| AbstractList | In this paper, we study collision-free graph exploration in an anonymous network. The network is modeled as a graph G=(V,E) where the nodes of the graph are unlabeled, and each edge incident to a node v has a unique label, called the port number, in {0,1,⋯,d−1}, where d is the degree of the node v. Two identical mobile agents, starting from different nodes in G have to explore the nodes of G in such a way that for every node v in G, at least one mobile agent visits v and no two agents are in the same node in any round and stop. The time of exploration is the minimum round number by which both agents have terminated. The agents know the size of the graph but do not know its topology. If an agent arrives in the one-hop neighborhood of the other agent, both agents can detect the presence of the other agent but have no idea at which neighboring node the other agent resides. The agents may wake up in different rounds, but once awake, execute a deterministic algorithm in synchronous rounds. An agent, after waking up, has no knowledge about the wake-up time of the other agent.
The task of collision-free exploration is impossible to solve even for a line of length 2 where the agents are placed at the end nodes of the line and even if both agents wake up at the same time. We study the problem of collision-free exploration where some pebbles are placed by an Oracle at the nodes of the graph to assist the agents in achieving collision-free exploration. The Oracle knows the graph, the starting positions of the agents, and their wake-up schedule, and it places some pebbles that may be of different colors, at most one at each node. The number of different colors of the pebbles placed by the Oracle is called the color index of the corresponding pebble placement algorithm.
The central question we study in this paper is as follows.
“What is the minimum number z such that there exists a collision-free exploration of a given graph with pebble placement of color index z?”
For general graphs, we show that it is impossible to design a deterministic algorithm that achieves collision-free exploration with color index 1. We propose an exploration algorithm with color index 3. We also proposed a polynomial exploration algorithm for bipartite graphs with color index 1. |
| ArticleNumber | 105380 |
| Author | Das, Sajal K. Dhar, Amit Kumar Gorain, Barun Mahawar, Madhuri |
| Author_xml | – sequence: 1 givenname: Sajal K. orcidid: 0000-0002-9471-0868 surname: Das fullname: Das, Sajal K. email: sdas@mst.edu organization: Department of Computer Science, Missouri University of Science and Technology, Rolla, USA – sequence: 2 givenname: Amit Kumar surname: Dhar fullname: Dhar, Amit Kumar email: amitkdhar@iitbhilai.ac.in organization: Department of Computer Science, Indian Institute of Technology Bhilai, Bhilai, India – sequence: 3 givenname: Barun orcidid: 0000-0003-2296-3222 surname: Gorain fullname: Gorain, Barun email: barun@iitbhilai.ac.in organization: Department of Computer Science, Indian Institute of Technology Bhilai, Bhilai, India – sequence: 4 givenname: Madhuri orcidid: 0009-0009-7851-6772 surname: Mahawar fullname: Mahawar, Madhuri email: madhurim@iitbhilai.ac.in organization: Department of Computer Science, Indian Institute of Technology Bhilai, Bhilai, India |
| BookMark | eNp1j8tqwzAQRbVIoUnafZf6AbsjW36ou2L6gkA32Qs9xkFGsYzklubv6-Buu7rMwLkzZ0c2YxiRkAcGOQNWPw65M3kBRbWMVdnChmyhFZBVHNgt2aU0ADBW8XpLRBe8d8mFMesjIsWfyYeo5mVB9YWeg3YeqTrhOCf6ldx4ohNq7THdkZte-YT3f7knx9eXY_eeHT7fPrrnQ2ZEsZzslWi4bQCWrJTRYIxtDPRQ68IWIIS1peBci6bhBUddalVqrlllFetbVe4JrLUmhpQi9nKK7qziRTKQV1s5SGfk1VautgvytCK4vPXtMMpkHI4GrYtoZmmD-x_-BUm-YCU |
| Cites_doi | 10.1016/0146-664X(74)90017-3 10.1016/j.tcs.2022.04.011 10.1145/274787.274788 10.1137/S0097539791194931 10.1016/S0022-0000(02)00023-5 10.1016/j.ic.2014.12.005 10.1145/3356883 10.1006/jagm.1994.1039 10.1016/j.jcss.2016.11.008 10.1002/(SICI)1097-0118(199911)32:3<265::AID-JGT6>3.0.CO;2-8 10.1145/1391289.1391291 10.1007/s00607-022-01136-8 10.1007/s10846-015-0309-9 10.1006/jagm.1999.1043 10.1002/net.20127 10.1006/inco.2001.3081 10.1016/j.jalgor.2003.10.002 |
| ContentType | Journal Article |
| Copyright | 2025 Elsevier Inc. |
| Copyright_xml | – notice: 2025 Elsevier Inc. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ic.2025.105380 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| ExternalDocumentID | 10_1016_j_ic_2025_105380 S0890540125001166 |
| GroupedDBID | --K --M --Z -~X .~1 0R~ 1B1 1~. 1~5 29I 4.4 457 4G. 5GY 5VS 6TJ 7-5 71M 8P~ 9DU 9JN AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AATTM AAXKI AAXUO AAYFN AAYWO ABAOU ABBOA ABDPE ABFNM ABJNI ABMAC ABWVN ABXDB ACDAQ ACGFS ACLOT ACNNM ACRPL ACVFH ACZNC ADBBV ADCNI ADEZE ADFGL ADMUD ADNMO ADVLN AEBSH AEIPS AEKER AENEX AEUPX AEXQZ AFJKZ AFPUW AFTJW AGHFR AGQPQ AGUBO AGYEJ AHZHX AIALX AIEXJ AIGII AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOUOD APXCP ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CAG COF CS3 DM4 DU5 E3Z EBS EFBJH EFKBS EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF HZ~ H~9 IHE IXB J1W KOM LG5 LX9 M41 MHUIS MO0 MVM N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 R2- RNS ROL RPZ SDF SDG SDP SES SEW SPC SPCBC SSV SSZ T5K TN5 WH7 WUQ XPP ZMT ZU3 ZY4 ~G- ~HD AAYXX CITATION |
| ID | FETCH-LOGICAL-c920-5fa974d700a975acb0ccd7c0f06b2d2099dd3944b977424eb3ba3b4b15da1f8a3 |
| ISSN | 0890-5401 |
| IngestDate | Thu Nov 27 01:02:53 EST 2025 Sat Nov 29 17:07:45 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Anonymous graph Exploration Mobile agent Deterministic algorithm |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c920-5fa974d700a975acb0ccd7c0f06b2d2099dd3944b977424eb3ba3b4b15da1f8a3 |
| ORCID | 0009-0009-7851-6772 0000-0003-2296-3222 0000-0002-9471-0868 |
| ParticipantIDs | crossref_primary_10_1016_j_ic_2025_105380 elsevier_sciencedirect_doi_10_1016_j_ic_2025_105380 |
| PublicationCentury | 2000 |
| PublicationDate | November 2025 2025-11-00 |
| PublicationDateYYYYMMDD | 2025-11-01 |
| PublicationDate_xml | – month: 11 year: 2025 text: November 2025 |
| PublicationDecade | 2020 |
| PublicationTitle | Information and computation |
| PublicationYear | 2025 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Bhagat, Pelc (br0060) 2025 Gorain, Mondal, Nayak, Pandit (br0030) 2022; 922 Czyzowicz, Dereniowski, Gasieniec, Klasing, Kosowski, Pajak (br0010) 2017; 86 Bender, Fernández, Ron, Sahai, Vadhan (br0100) 2002; 176 Bender, Slonim (br0110) 1994 Fraigniaud, Gasieniec, Kowalski, Pelc (br0160) 2006; 48 Diks, Fraigniaud, Kranakis, Pelc (br0140) 2004; 51 Shah (br0200) 1974; 3 Duncan, Kobourov, Kumar (br0150) 2001 Dhar, Gorain, Mondal, Patra, Singh (br0050) 2023; 105 Dereniowski, Disser, Kosowski, Pajak, Uznanski (br0130) 2015; 243 Glacet, Miller, Pelc (br0040) 2016 Czyzowicz, Dobrev, Killick, Kranakis, Krizanc, Narayanan, Opatrny, Pankratov, Shende (br0180) 2021; vol. 12810 Reingold (br0270) 2008; 55 Bhattacharya, Gorain, Mandal (br0240) 2022; vol. 13751 Deng, Kameda, Papadimitriou (br0090) 1998; 45 Deng, Papadimitriou (br0120) 1999; 32 Disser, Hackfeld, Klimm (br0190) 2019; 66 Koucký (br0260) 2002; 65 Hoffmann (br0230) 1981; vol. 117 Nagavarapu, Vachhani, Sinha (br0280) 2016; 83 Blum, Kozen (br0220) 1978 Panaite, Pelc (br0170) 1999; 33 Blum, Raghavan, Schieber (br0080) 1997; 26 Bar-Eli, Berman, Fiat, Yan (br0070) 1994; 17 Blum, Sakoda (br0210) 1977 Nakaminami, Masuzawa, Herman (br0020) 2004; 87-D Blum (10.1016/j.ic.2025.105380_br0220) 1978 Blum (10.1016/j.ic.2025.105380_br0210) 1977 Fraigniaud (10.1016/j.ic.2025.105380_br0160) 2006; 48 Blum (10.1016/j.ic.2025.105380_br0080) 1997; 26 Dereniowski (10.1016/j.ic.2025.105380_br0130) 2015; 243 Czyzowicz (10.1016/j.ic.2025.105380_br0180) 2021; vol. 12810 Disser (10.1016/j.ic.2025.105380_br0190) 2019; 66 Reingold (10.1016/j.ic.2025.105380_br0270) 2008; 55 Deng (10.1016/j.ic.2025.105380_br0090) 1998; 45 Bar-Eli (10.1016/j.ic.2025.105380_br0070) 1994; 17 Koucký (10.1016/j.ic.2025.105380_br0260) 2002; 65 Glacet (10.1016/j.ic.2025.105380_br0040) 2016 Panaite (10.1016/j.ic.2025.105380_br0170) 1999; 33 Czyzowicz (10.1016/j.ic.2025.105380_br0010) 2017; 86 Bender (10.1016/j.ic.2025.105380_br0100) 2002; 176 Hoffmann (10.1016/j.ic.2025.105380_br0230) 1981; vol. 117 Diks (10.1016/j.ic.2025.105380_br0140) 2004; 51 Deng (10.1016/j.ic.2025.105380_br0120) 1999; 32 Dhar (10.1016/j.ic.2025.105380_br0050) 2023; 105 Shah (10.1016/j.ic.2025.105380_br0200) 1974; 3 Bhattacharya (10.1016/j.ic.2025.105380_br0240) 2022; vol. 13751 Gorain (10.1016/j.ic.2025.105380_br0030) 2022; 922 Nagavarapu (10.1016/j.ic.2025.105380_br0280) 2016; 83 Duncan (10.1016/j.ic.2025.105380_br0150) 2001 Bhagat (10.1016/j.ic.2025.105380_br0060) 2025 Bender (10.1016/j.ic.2025.105380_br0110) 1994 Nakaminami (10.1016/j.ic.2025.105380_br0020) 2004; 87-D |
| References_xml | – volume: vol. 13751 start-page: 99 year: 2022 end-page: 113 ident: br0240 article-title: Treasure hunt in graph using pebbles publication-title: Stabilization, Safety, and Security of Distributed Systems - 24th International Symposium, SSS 2022, Clermont-Ferrand, France, November 15-17, 2022, Proceedings – start-page: 147 year: 1977 end-page: 161 ident: br0210 article-title: On the capability of finite automata in 2 and 3 dimensional space publication-title: 18th Annual Symposium on Foundations of Computer Science – start-page: 807 year: 2001 end-page: 814 ident: br0150 article-title: Optimal constrained graph exploration publication-title: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms – volume: 65 start-page: 717 year: 2002 end-page: 726 ident: br0260 article-title: Universal traversal sequences with backtracking publication-title: J. Comput. Syst. Sci. – volume: 86 start-page: 70 year: 2017 end-page: 81 ident: br0010 article-title: Collision-free network exploration publication-title: J. Comput. Syst. Sci. – volume: 32 start-page: 265 year: 1999 end-page: 297 ident: br0120 article-title: Exploring an unknown graph publication-title: J. Graph Theory – volume: 83 start-page: 503 year: 2016 end-page: 523 ident: br0280 article-title: Multi-robot graph exploration and map building with collision avoidance: a decentralized approach publication-title: J. Intell. Robot. Syst. – volume: 176 start-page: 1 year: 2002 end-page: 21 ident: br0100 article-title: The power of a pebble: exploring and mapping directed graphs publication-title: Inf. Comput. – volume: 55 year: 2008 ident: br0270 article-title: Undirected connectivity in log-space publication-title: J. ACM – volume: 105 start-page: 483 year: 2023 end-page: 506 ident: br0050 article-title: Edge exploration of anonymous graph by mobile agent with external help publication-title: Computing – volume: 922 start-page: 61 year: 2022 end-page: 80 ident: br0030 article-title: Pebble guided optimal treasure hunt in anonymous graphs publication-title: Theor. Comput. Sci. – volume: 243 start-page: 37 year: 2015 end-page: 49 ident: br0130 article-title: Fast collaborative graph exploration publication-title: Inf. Comput. – volume: 3 start-page: 236 year: 1974 end-page: 246 ident: br0200 article-title: Pebble automata on arrays publication-title: Comput. Graph. Image Process. – volume: 87-D start-page: 2773 year: 2004 end-page: 2780 ident: br0020 article-title: Self-stabilizing agent traversal on tree networks publication-title: IEICE Trans. Inf. Syst. – volume: 45 start-page: 215 year: 1998 end-page: 245 ident: br0090 article-title: How to learn an unknown environment I: the rectilinear case publication-title: J. ACM – start-page: 600 year: 2016 end-page: 609 ident: br0040 article-title: Time vs. information tradeoffs for leader election in anonymous trees publication-title: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms – volume: 51 start-page: 38 year: 2004 end-page: 63 ident: br0140 article-title: Tree exploration with little memory publication-title: J. Algorithms – start-page: 132 year: 1978 end-page: 142 ident: br0220 article-title: On the power of the compass (or, why mazes are easier to search than graphs) publication-title: 19th Annual Symposium on Foundations of Computer Science – volume: 66 year: 2019 ident: br0190 article-title: Tight bounds for undirected graph exploration with pebbles and multiple agents publication-title: J. ACM – volume: 48 start-page: 166 year: 2006 end-page: 177 ident: br0160 article-title: Collective tree exploration publication-title: Networks – volume: vol. 12810 start-page: 185 year: 2021 end-page: 203 ident: br0180 article-title: Graph exploration by energy-sharing mobile agents publication-title: Structural Information and Communication Complexity - 28th International Colloquium, SIROCCO 2021, Wrocław, Poland, June 28 - July 1, 2021, Proceedings – volume: 17 start-page: 319 year: 1994 end-page: 341 ident: br0070 article-title: Online navigation in a room publication-title: J. Algorithms – start-page: 115 year: 2025 end-page: 124 ident: br0060 article-title: Deterministic collision-free exploration of unknown anonymous graphs publication-title: Proceedings of the 26th International Conference on Distributed Computing and Networking – volume: 26 start-page: 110 year: 1997 end-page: 137 ident: br0080 article-title: Navigating in unfamiliar geometric terrain publication-title: SIAM J. Comput. – start-page: 75 year: 1994 end-page: 85 ident: br0110 article-title: The power of team exploration: two robots can learn unlabeled directed graphs publication-title: 35th Annual Symposium on Foundations of Computer Science, Santa Fe – volume: 33 start-page: 281 year: 1999 end-page: 295 ident: br0170 article-title: Exploring unknown undirected graphs publication-title: J. Algorithms – volume: vol. 117 start-page: 433 year: 1981 end-page: 444 ident: br0230 article-title: One pebble does not suffice to search plane labyrinths publication-title: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference – start-page: 115 year: 2025 ident: 10.1016/j.ic.2025.105380_br0060 article-title: Deterministic collision-free exploration of unknown anonymous graphs – start-page: 75 year: 1994 ident: 10.1016/j.ic.2025.105380_br0110 article-title: The power of team exploration: two robots can learn unlabeled directed graphs – volume: vol. 117 start-page: 433 year: 1981 ident: 10.1016/j.ic.2025.105380_br0230 article-title: One pebble does not suffice to search plane labyrinths – volume: 87-D start-page: 2773 issue: 12 year: 2004 ident: 10.1016/j.ic.2025.105380_br0020 article-title: Self-stabilizing agent traversal on tree networks publication-title: IEICE Trans. Inf. Syst. – volume: 3 start-page: 236 issue: 3 year: 1974 ident: 10.1016/j.ic.2025.105380_br0200 article-title: Pebble automata on arrays publication-title: Comput. Graph. Image Process. doi: 10.1016/0146-664X(74)90017-3 – volume: 922 start-page: 61 year: 2022 ident: 10.1016/j.ic.2025.105380_br0030 article-title: Pebble guided optimal treasure hunt in anonymous graphs publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2022.04.011 – volume: 45 start-page: 215 issue: 2 year: 1998 ident: 10.1016/j.ic.2025.105380_br0090 article-title: How to learn an unknown environment I: the rectilinear case publication-title: J. ACM doi: 10.1145/274787.274788 – volume: 26 start-page: 110 issue: 1 year: 1997 ident: 10.1016/j.ic.2025.105380_br0080 article-title: Navigating in unfamiliar geometric terrain publication-title: SIAM J. Comput. doi: 10.1137/S0097539791194931 – start-page: 807 year: 2001 ident: 10.1016/j.ic.2025.105380_br0150 article-title: Optimal constrained graph exploration – volume: 65 start-page: 717 issue: 4 year: 2002 ident: 10.1016/j.ic.2025.105380_br0260 article-title: Universal traversal sequences with backtracking publication-title: J. Comput. Syst. Sci. doi: 10.1016/S0022-0000(02)00023-5 – volume: vol. 13751 start-page: 99 year: 2022 ident: 10.1016/j.ic.2025.105380_br0240 article-title: Treasure hunt in graph using pebbles – start-page: 600 year: 2016 ident: 10.1016/j.ic.2025.105380_br0040 article-title: Time vs. information tradeoffs for leader election in anonymous trees – volume: 243 start-page: 37 year: 2015 ident: 10.1016/j.ic.2025.105380_br0130 article-title: Fast collaborative graph exploration publication-title: Inf. Comput. doi: 10.1016/j.ic.2014.12.005 – volume: 66 issue: 6 year: 2019 ident: 10.1016/j.ic.2025.105380_br0190 article-title: Tight bounds for undirected graph exploration with pebbles and multiple agents publication-title: J. ACM doi: 10.1145/3356883 – volume: vol. 12810 start-page: 185 year: 2021 ident: 10.1016/j.ic.2025.105380_br0180 article-title: Graph exploration by energy-sharing mobile agents – volume: 17 start-page: 319 issue: 3 year: 1994 ident: 10.1016/j.ic.2025.105380_br0070 article-title: Online navigation in a room publication-title: J. Algorithms doi: 10.1006/jagm.1994.1039 – volume: 86 start-page: 70 year: 2017 ident: 10.1016/j.ic.2025.105380_br0010 article-title: Collision-free network exploration publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2016.11.008 – volume: 32 start-page: 265 issue: 3 year: 1999 ident: 10.1016/j.ic.2025.105380_br0120 article-title: Exploring an unknown graph publication-title: J. Graph Theory doi: 10.1002/(SICI)1097-0118(199911)32:3<265::AID-JGT6>3.0.CO;2-8 – start-page: 147 year: 1977 ident: 10.1016/j.ic.2025.105380_br0210 article-title: On the capability of finite automata in 2 and 3 dimensional space – volume: 55 issue: 4 year: 2008 ident: 10.1016/j.ic.2025.105380_br0270 article-title: Undirected connectivity in log-space publication-title: J. ACM doi: 10.1145/1391289.1391291 – volume: 105 start-page: 483 issue: 2 year: 2023 ident: 10.1016/j.ic.2025.105380_br0050 article-title: Edge exploration of anonymous graph by mobile agent with external help publication-title: Computing doi: 10.1007/s00607-022-01136-8 – volume: 83 start-page: 503 issue: 3–4 year: 2016 ident: 10.1016/j.ic.2025.105380_br0280 article-title: Multi-robot graph exploration and map building with collision avoidance: a decentralized approach publication-title: J. Intell. Robot. Syst. doi: 10.1007/s10846-015-0309-9 – volume: 33 start-page: 281 issue: 2 year: 1999 ident: 10.1016/j.ic.2025.105380_br0170 article-title: Exploring unknown undirected graphs publication-title: J. Algorithms doi: 10.1006/jagm.1999.1043 – start-page: 132 year: 1978 ident: 10.1016/j.ic.2025.105380_br0220 article-title: On the power of the compass (or, why mazes are easier to search than graphs) – volume: 48 start-page: 166 issue: 3 year: 2006 ident: 10.1016/j.ic.2025.105380_br0160 article-title: Collective tree exploration publication-title: Networks doi: 10.1002/net.20127 – volume: 176 start-page: 1 issue: 1 year: 2002 ident: 10.1016/j.ic.2025.105380_br0100 article-title: The power of a pebble: exploring and mapping directed graphs publication-title: Inf. Comput. doi: 10.1006/inco.2001.3081 – volume: 51 start-page: 38 issue: 1 year: 2004 ident: 10.1016/j.ic.2025.105380_br0140 article-title: Tree exploration with little memory publication-title: J. Algorithms doi: 10.1016/j.jalgor.2003.10.002 |
| SSID | ssj0011546 |
| Score | 2.4227805 |
| Snippet | In this paper, we study collision-free graph exploration in an anonymous network. The network is modeled as a graph G=(V,E) where the nodes of the graph are... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 105380 |
| SubjectTerms | Anonymous graph Deterministic algorithm Exploration Mobile agent |
| Title | Collision-free exploration by mobile agents using pebbles |
| URI | https://dx.doi.org/10.1016/j.ic.2025.105380 |
| Volume | 307 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: ScienceDirect database issn: 0890-5401 databaseCode: AIEXJ dateStart: 20211207 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0011546 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1ba9swFBZZu4ftobettF1X9LCXUlx8l_UYto7dWgoNJW9GNzcOqRO8uJd_vyNL8pxdYBvsxQkCKUGfOXw6-r5zEHojw4CplBAvBb7sxQVNPSZI4ClfUhZHBZNtAdPrL-TiIhuP6eVg0Ln472akqrKHB7r4r1DDGICtrbN_AXe3KAzAdwAdngA7PP8IeJ0KaA3jXlErpUv4zxzMQDVv5xziwAm7aZ1tTZspWCjOZ1ZLOHXK9s7V6Jxvi2b11v6dsYJdsSmg_Pm0G54YyfbwtlyetALuTuIzr5ntDs_qplvnnE3YvZlzzuSkqct-JiJMrCWvS485i8yKgtPPqK_VF0E_5Eam0-1P4dtkEqanpS4uGSa6CXFkGj39UBT7Si-rVwUGp6-S0idoPSQJhbi2Pvx4Nv7U3SQF1qzl_oa9qjYav9Xf-TU16dGN0RbasOcEPDT4bqOBqnbQpuvBgW1I3kHPewUlXyC6Cj7ugY_5IzbgYwM-bsHHFvyXaPT-bPT2g2ebY3iCwok_KRicBCXxffhMmOC-EJIIv_BTHkrth5ZSe5655vdhrHjEWcRjHiSSBUXGol20Vs0rtYcwcEoVxoTTRKWxrvXE4iQriiDThFoKuo-O3bbkC1MCJXfawGleilxvYW62cB9Fbt9yS-EMNcsB4t_OOvinWa_Qs-9v4SFaW9aNeo2eirtl-bU-su_BNzm-aEQ |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Collision-free+exploration+by+mobile+agents+using+pebbles&rft.jtitle=Information+and+computation&rft.au=Das%2C+Sajal+K.&rft.au=Dhar%2C+Amit+Kumar&rft.au=Gorain%2C+Barun&rft.au=Mahawar%2C+Madhuri&rft.date=2025-11-01&rft.pub=Elsevier+Inc&rft.issn=0890-5401&rft.volume=307&rft_id=info:doi/10.1016%2Fj.ic.2025.105380&rft.externalDocID=S0890540125001166 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0890-5401&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0890-5401&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0890-5401&client=summon |