Dispersion of mobile robots on graphs in the asynchronous model
The dispersion problem on graphs requires k robots placed arbitrarily at the n nodes of an anonymous graph, where k≤n, to coordinate with each other to reach a final configuration in which each robot is at a distinct node of the graph. The dispersion problem is important due to its relationship to g...
Saved in:
| Published in: | Theoretical computer science Vol. 1044; p. 115272 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
01.08.2025
|
| Subjects: | |
| ISSN: | 0304-3975 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | The dispersion problem on graphs requires k robots placed arbitrarily at the n nodes of an anonymous graph, where k≤n, to coordinate with each other to reach a final configuration in which each robot is at a distinct node of the graph. The dispersion problem is important due to its relationship to graph exploration by mobile robots, scattering on a graph, and load balancing on a graph. Prior work on solving dispersion assumed the synchronous model. We propose four algorithms to solve dispersion on graphs in the asynchronous model. The first two algorithms require O(klogΔ) bits at each robot and O(min(m,kΔ)) steps running time, where m is the number of edges and Δ is the maximum degree of the graph. The algorithms differ in what, where, and how data structures are maintained. The third algorithm has a space usage of O(max(min(D,k)⋅logΔ,logD)) bits at each robot and uses O(Δmin(D,k)+1) steps, where D is the graph diameter. The fourth algorithm has a space usage of O(max(logk,logΔ)) bits at each robot and uses O(min(m,kΔ)⋅k) steps. In contrast with existing works which all assume the synchronous model, these are the first algorithms to solve dispersion in the weaker but more realistic asynchronous model. |
|---|---|
| AbstractList | The dispersion problem on graphs requires k robots placed arbitrarily at the n nodes of an anonymous graph, where k≤n, to coordinate with each other to reach a final configuration in which each robot is at a distinct node of the graph. The dispersion problem is important due to its relationship to graph exploration by mobile robots, scattering on a graph, and load balancing on a graph. Prior work on solving dispersion assumed the synchronous model. We propose four algorithms to solve dispersion on graphs in the asynchronous model. The first two algorithms require O(klogΔ) bits at each robot and O(min(m,kΔ)) steps running time, where m is the number of edges and Δ is the maximum degree of the graph. The algorithms differ in what, where, and how data structures are maintained. The third algorithm has a space usage of O(max(min(D,k)⋅logΔ,logD)) bits at each robot and uses O(Δmin(D,k)+1) steps, where D is the graph diameter. The fourth algorithm has a space usage of O(max(logk,logΔ)) bits at each robot and uses O(min(m,kΔ)⋅k) steps. In contrast with existing works which all assume the synchronous model, these are the first algorithms to solve dispersion in the weaker but more realistic asynchronous model. |
| ArticleNumber | 115272 |
| Author | Kshemkalyani, Ajay D. |
| Author_xml | – sequence: 1 givenname: Ajay D. surname: Kshemkalyani fullname: Kshemkalyani, Ajay D. email: ajay@uic.edu organization: Department of Computer Science, University of Illinois Chicago, Chicago, IL 60607, USA |
| BookMark | eNp9z8tKAzEUgOEsKthWH8BdXmDGXGcmuBCpVyi40XXIZM7YlGlSkij07U2pKxfN5kA4_4FvgWY-eEDohpKaEtrcbutsU80IkzWlkrVshuaEE1Fx1cpLtEhpS8qTbTNH948u7SEmFzwOI96F3k2AY-hDTrj8fUWz3yTsPM4bwCYdvN3E4MN3KrsDTFfoYjRTguu_uUSfz08fq9dq_f7ytnpYV5YLlqteCiWUlIR2tOOjkMZ0gqmWdO0gFKUDA64YaawhchyV6vuBSMOFMMxA01i-RPR018aQUoRR76PbmXjQlOijWm91UeujWp_UpWn_NdZlkws1R-Oms-XdqYRC-nEQdbIOvIXBRbBZD8GdqX8Bd5N1Jg |
| CitedBy_id | crossref_primary_10_1007_s42979_025_04331_4 |
| Cites_doi | 10.1016/j.tcs.2010.11.023 10.1016/j.ipl.2017.06.010 10.1016/0743-7315(89)90021-X 10.1007/978-3-031-02008-7 10.1016/0743-7315(92)90021-E 10.1142/S0129054111008295 10.1145/1383369.1383373 10.1016/j.jda.2015.10.005 10.1145/1921659.1921663 10.1145/1391289.1391291 10.1002/net.20127 10.1016/j.jpdc.2018.09.015 10.1016/j.ic.2014.12.005 10.1007/s002240000092 10.1016/j.jpdc.2018.03.008 10.1016/j.tcs.2005.07.014 10.1007/s00453-003-1030-9 |
| ContentType | Journal Article |
| Copyright | 2025 The Author |
| Copyright_xml | – notice: 2025 The Author |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.tcs.2025.115272 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| ExternalDocumentID | 10_1016_j_tcs_2025_115272 S0304397525002105 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 6I. 7-5 71M 8P~ 9JN AABNK AAEDW AAFTH AAIKJ AAKOC AALRI AAOAW AAQFI AATTM AAXKI AAXUO AAYFN AAYWO ABAOU ABBOA ABJNI ABMAC ACDAQ ACGFS ACRLP ACVFH ACZNC ADBBV ADCNI ADEZE AEBSH AEIPS AEKER AENEX AEUPX AFJKZ AFPUW AFTJW AFXIZ AGCQF AGRNS AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGII AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOUOD APXCP ARUGR AXJTR BKOJK BLXMC BNPGV CS3 DU5 EBS EFJIC EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 ROL RPZ SCC SDF SDG SES SEW SPC SPCBC SSH SSV SSW T5K TN5 WH7 YNT ZMT ~G- 29Q 9DU AAEDT AAQXK AAYXX ABDPE ABEFU ABFNM ABWVN ABXDB ACLOT ACNNM ACRPL ADMUD ADNMO ADVLN AEXQZ AGHFR AGQPQ ASPBG AVWKF AZFZN CITATION EFKBS EFLBG EJD FGOYB G-2 HZ~ R2- SSZ TAE WUQ ZY4 ~HD |
| ID | FETCH-LOGICAL-c342t-b5494955018183f45aa84297087d4911d2e39206ca05ff99bbd05a344a2ae66c3 |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001494057400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0304-3975 |
| IngestDate | Sat Nov 29 07:56:44 EST 2025 Tue Nov 18 21:59:53 EST 2025 Sat Jun 07 17:02:01 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Mobile robot Graph exploration Dispersion Graph algorithm Distributed algorithm |
| Language | English |
| License | This is an open access article under the CC BY license. |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c342t-b5494955018183f45aa84297087d4911d2e39206ca05ff99bbd05a344a2ae66c3 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.tcs.2025.115272 |
| ParticipantIDs | crossref_primary_10_1016_j_tcs_2025_115272 crossref_citationtrail_10_1016_j_tcs_2025_115272 elsevier_sciencedirect_doi_10_1016_j_tcs_2025_115272 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-08-01 2025-08-00 |
| PublicationDateYYYYMMDD | 2025-08-01 |
| PublicationDate_xml | – month: 08 year: 2025 text: 2025-08-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2025 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Shibata, Mega, Ooshita, Kakugawa, Masuzawa (br0250) 2018; 119 Poudel, Sharma (br0270) 2019 Cohen, Fraigniaud, Ilcinkas, Korman, Peleg (br0150) 2008; 4 Pattanayak, Mondal, Ramesh, Mandal (br0220) 2019; 123 Fraigniaud, Gasieniec, Kowalski, Pelc (br0120) 2006; 48 Gorain, Pelc (br0160) 2017; vol. 80 Dereniowski, Disser, Kosowski, Pajak, Uznanski (br0170) 2015; 243 Xu, Lau (br0310) 1992; 16 Flocchini, Prencipe, Santoro (br0040) 2012 Muthukrishnan, Ghosh, Schultz (br0290) 1998; 31 Cybenko (br0280) 1989; 7 Elor, Bruckstein (br0230) 2011; 412 Mclurkin, Smith (br0020) 2004 Kshemkalyani, Ali (br0070) 2018 Menc, Pajak, Uznanski (br0200) 2017; 127 (br0050) 2019; vol. 11340 Kshemkalyani, Molla, Sharma (br0100) 2020 Subramanian, Scherson (br0300) 1994 Kshemkalyani, Ali (br0060) 2019 Kshemkalyani, Molla, Sharma (br0090) 2019; vol. 11931 Barrière, Flocchini, Barrameda, Santoro (br0260) 2011; 22 Fraigniaud, Ilcinkas, Peer, Pelc, Peleg (br0130) 2005; 345 Hsiang, Arkin, Bender, Fekete, Mitchell (br0010) 2002 Augustine, Moses-Jr. (br0030) 2018 Shibata, Mega, Ooshita, Kakugawa, Masuzawa (br0240) 2016 Ambühl, Gasieniec, Pelc, Radzik, Zhang (br0110) 2011; 7 Bhagat, Chaudhuri, Mukhopadhyaya (br0210) 2016; 36 Yanovski, Wagner, Bruckstein (br0180) 2003; 37 Bampas, Gasieniec, Hanusse, Ilcinkas, Klasing, Kosowski (br0190) 2009 Reingold (br0140) 2008; 55 Augustine, Moses-Jr. (br0080) 2018 Kshemkalyani (10.1016/j.tcs.2025.115272_br0070) Barrière (10.1016/j.tcs.2025.115272_br0260) 2011; 22 Bampas (10.1016/j.tcs.2025.115272_br0190) 2009 Elor (10.1016/j.tcs.2025.115272_br0230) 2011; 412 Kshemkalyani (10.1016/j.tcs.2025.115272_br0060) 2019 Mclurkin (10.1016/j.tcs.2025.115272_br0020) 2004 Menc (10.1016/j.tcs.2025.115272_br0200) 2017; 127 Muthukrishnan (10.1016/j.tcs.2025.115272_br0290) 1998; 31 Fraigniaud (10.1016/j.tcs.2025.115272_br0120) 2006; 48 Reingold (10.1016/j.tcs.2025.115272_br0140) 2008; 55 Cohen (10.1016/j.tcs.2025.115272_br0150) 2008; 4 (10.1016/j.tcs.2025.115272_br0050) 2019; vol. 11340 Cybenko (10.1016/j.tcs.2025.115272_br0280) 1989; 7 Shibata (10.1016/j.tcs.2025.115272_br0240) 2016 Subramanian (10.1016/j.tcs.2025.115272_br0300) 1994 Kshemkalyani (10.1016/j.tcs.2025.115272_br0090) 2019; vol. 11931 Augustine (10.1016/j.tcs.2025.115272_br0080) Poudel (10.1016/j.tcs.2025.115272_br0270) 2019 Shibata (10.1016/j.tcs.2025.115272_br0250) 2018; 119 Kshemkalyani (10.1016/j.tcs.2025.115272_br0100) 2020 Xu (10.1016/j.tcs.2025.115272_br0310) 1992; 16 Ambühl (10.1016/j.tcs.2025.115272_br0110) 2011; 7 Yanovski (10.1016/j.tcs.2025.115272_br0180) 2003; 37 Flocchini (10.1016/j.tcs.2025.115272_br0040) 2012 Augustine (10.1016/j.tcs.2025.115272_br0030) 2018 Pattanayak (10.1016/j.tcs.2025.115272_br0220) 2019; 123 Bhagat (10.1016/j.tcs.2025.115272_br0210) 2016; 36 Dereniowski (10.1016/j.tcs.2025.115272_br0170) 2015; 243 Hsiang (10.1016/j.tcs.2025.115272_br0010) 2002 Fraigniaud (10.1016/j.tcs.2025.115272_br0130) 2005; 345 Gorain (10.1016/j.tcs.2025.115272_br0160) 2017; vol. 80 |
| References_xml | – start-page: 1:1 year: 2018 end-page: 1:10 ident: br0030 article-title: Dispersion of mobile robots: a study of memory-time trade-offs publication-title: Proceedings of the 19th International Conference on Distributed Computing and Networking – start-page: 77 year: 2002 end-page: 94 ident: br0010 article-title: Algorithms for rapidly dispersing robot swarms in unknown environments publication-title: Algorithmic Foundations of Robotics V, Selected Contributions of the Fifth International Workshop on the Algorithmic Foundations of Robotics – volume: 345 start-page: 331 year: 2005 end-page: 344 ident: br0130 article-title: Graph exploration by a finite automaton publication-title: Theor. Comput. Sci. – volume: vol. 80 start-page: 132:1 year: 2017 end-page: 132:14 ident: br0160 article-title: Deterministic graph exploration with advice publication-title: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) – year: 2018 ident: br0070 article-title: Efficient dispersion of mobile robots on graphs – start-page: 415 year: 2016 end-page: 424 ident: br0240 article-title: Uniform deployment of mobile agents in asynchronous rings publication-title: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing – volume: 119 start-page: 92 year: 2018 end-page: 106 ident: br0250 article-title: Uniform deployment of mobile agents in asynchronous rings publication-title: J. Parallel Distrib. Comput. – year: 2018 ident: br0080 article-title: Dispersion of mobile robots: a study of memory-time trade-offs – volume: 48 start-page: 166 year: 2006 end-page: 177 ident: br0120 article-title: Collective tree exploration publication-title: Networks – start-page: 423 year: 2009 end-page: 435 ident: br0190 article-title: Euler tour lock-in problem in the rotor-router model publication-title: Distributed Computing, 23rd International Symposium – volume: 7 start-page: 279 year: 1989 end-page: 301 ident: br0280 article-title: Dynamic load balancing for distributed memory multiprocessors publication-title: J. Parallel Distrib. Comput. – volume: 22 start-page: 679 year: 2011 end-page: 697 ident: br0260 article-title: Uniform scattering of autonomous mobile robots in a grid publication-title: Int. J. Found. Comput. Sci. – volume: vol. 11931 start-page: 23 year: 2019 end-page: 40 ident: br0090 article-title: Fast dispersion of mobile robots on arbitrary graphs publication-title: 15th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2019 – volume: 123 start-page: 145 year: 2019 end-page: 155 ident: br0220 article-title: Gathering of mobile robots with weak multiplicity detection in presence of crash-faults publication-title: J. Parallel Distrib. Comput. – volume: 16 start-page: 385 year: 1992 end-page: 393 ident: br0310 article-title: Analysis of the generalized dimension exchange method for dynamic load balancing publication-title: J. Parallel Distrib. Comput. – volume: 55 start-page: 17:1 year: 2008 end-page: 17:24 ident: br0140 article-title: Undirected connectivity in log-space publication-title: J. ACM – volume: 36 start-page: 50 year: 2016 end-page: 62 ident: br0210 article-title: Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement publication-title: J. Discret. Algorithms – start-page: 228 year: 2019 end-page: 237 ident: br0270 article-title: Time-optimal uniform scattering in a grid publication-title: Proceedings of the 20th International Conference on Distributed Computing and Networking – year: 2012 ident: br0040 article-title: Distributed Computing by Oblivious Mobile Robots publication-title: Synthesis Lectures on Distributed Computing Theory – volume: 243 start-page: 37 year: 2015 end-page: 49 ident: br0170 article-title: Fast collaborative graph exploration publication-title: Inf. Comput. – start-page: 220 year: 1994 end-page: 225 ident: br0300 article-title: An analysis of diffusive load-balancing publication-title: SPAA – start-page: 218 year: 2019 end-page: 227 ident: br0060 article-title: Efficient dispersion of mobile robots on graphs publication-title: Proceedings of the 20th International Conference on Distributed Computing and Networking – year: 2004 ident: br0020 article-title: Distributed algorithms for dispersion in indoor environments using a swarm of autonomous mobile robots publication-title: 7th International Symposium on Distributed Autonomous Robotic Systems (DARS) – volume: 4 start-page: 42:1 year: 2008 end-page: 42:18 ident: br0150 article-title: Label-guided graph exploration by a finite automaton publication-title: ACM Trans. Algorithms – start-page: 12:1 year: 2020 end-page: 12:10 ident: br0100 article-title: Dispersion of mobile robots in the global communication model publication-title: 21st International Conference on Distributed Computing and Networking (ICDCN) – volume: 412 start-page: 783 year: 2011 end-page: 795 ident: br0230 article-title: Uniform multi-agent deployment on a ring publication-title: Theor. Comput. Sci. – volume: 7 start-page: 17:1 year: 2011 end-page: 17:21 ident: br0110 article-title: Tree exploration with logarithmic memory publication-title: ACM Trans. Algorithms – volume: 127 start-page: 17 year: 2017 end-page: 20 ident: br0200 article-title: Time and space optimality of rotor-router graph exploration publication-title: Inf. Process. Lett. – volume: vol. 11340 year: 2019 ident: br0050 publication-title: Distributed Computing by Mobile Entities, Current Research in Moving and Computing – volume: 31 start-page: 331 year: 1998 end-page: 354 ident: br0290 article-title: First- and second-order diffusive methods for rapid, coarse, distributed load balancing publication-title: Theory Comput. Syst. – volume: 37 start-page: 165 year: 2003 end-page: 186 ident: br0180 article-title: A distributed ant algorithm for efficiently patrolling a network publication-title: Algorithmica – volume: 412 start-page: 783 issue: 8–10 year: 2011 ident: 10.1016/j.tcs.2025.115272_br0230 article-title: Uniform multi-agent deployment on a ring publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2010.11.023 – start-page: 415 year: 2016 ident: 10.1016/j.tcs.2025.115272_br0240 article-title: Uniform deployment of mobile agents in asynchronous rings – volume: 127 start-page: 17 year: 2017 ident: 10.1016/j.tcs.2025.115272_br0200 article-title: Time and space optimality of rotor-router graph exploration publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2017.06.010 – start-page: 77 year: 2002 ident: 10.1016/j.tcs.2025.115272_br0010 article-title: Algorithms for rapidly dispersing robot swarms in unknown environments – start-page: 218 year: 2019 ident: 10.1016/j.tcs.2025.115272_br0060 article-title: Efficient dispersion of mobile robots on graphs – volume: 7 start-page: 279 issue: 2 year: 1989 ident: 10.1016/j.tcs.2025.115272_br0280 article-title: Dynamic load balancing for distributed memory multiprocessors publication-title: J. Parallel Distrib. Comput. doi: 10.1016/0743-7315(89)90021-X – year: 2012 ident: 10.1016/j.tcs.2025.115272_br0040 article-title: Distributed Computing by Oblivious Mobile Robots doi: 10.1007/978-3-031-02008-7 – start-page: 423 year: 2009 ident: 10.1016/j.tcs.2025.115272_br0190 article-title: Euler tour lock-in problem in the rotor-router model – volume: 16 start-page: 385 issue: 4 year: 1992 ident: 10.1016/j.tcs.2025.115272_br0310 article-title: Analysis of the generalized dimension exchange method for dynamic load balancing publication-title: J. Parallel Distrib. Comput. doi: 10.1016/0743-7315(92)90021-E – volume: 22 start-page: 679 issue: 3 year: 2011 ident: 10.1016/j.tcs.2025.115272_br0260 article-title: Uniform scattering of autonomous mobile robots in a grid publication-title: Int. J. Found. Comput. Sci. doi: 10.1142/S0129054111008295 – year: 2004 ident: 10.1016/j.tcs.2025.115272_br0020 article-title: Distributed algorithms for dispersion in indoor environments using a swarm of autonomous mobile robots – volume: 4 start-page: 42:1 issue: 4 year: 2008 ident: 10.1016/j.tcs.2025.115272_br0150 article-title: Label-guided graph exploration by a finite automaton publication-title: ACM Trans. Algorithms doi: 10.1145/1383369.1383373 – volume: 36 start-page: 50 year: 2016 ident: 10.1016/j.tcs.2025.115272_br0210 article-title: Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement publication-title: J. Discret. Algorithms doi: 10.1016/j.jda.2015.10.005 – volume: 7 start-page: 17:1 issue: 2 year: 2011 ident: 10.1016/j.tcs.2025.115272_br0110 article-title: Tree exploration with logarithmic memory publication-title: ACM Trans. Algorithms doi: 10.1145/1921659.1921663 – volume: 55 start-page: 17:1 issue: 4 year: 2008 ident: 10.1016/j.tcs.2025.115272_br0140 article-title: Undirected connectivity in log-space publication-title: J. ACM doi: 10.1145/1391289.1391291 – start-page: 12:1 year: 2020 ident: 10.1016/j.tcs.2025.115272_br0100 article-title: Dispersion of mobile robots in the global communication model – volume: vol. 80 start-page: 132:1 year: 2017 ident: 10.1016/j.tcs.2025.115272_br0160 article-title: Deterministic graph exploration with advice – volume: 48 start-page: 166 issue: 3 year: 2006 ident: 10.1016/j.tcs.2025.115272_br0120 article-title: Collective tree exploration publication-title: Networks doi: 10.1002/net.20127 – start-page: 228 year: 2019 ident: 10.1016/j.tcs.2025.115272_br0270 article-title: Time-optimal uniform scattering in a grid – volume: 123 start-page: 145 year: 2019 ident: 10.1016/j.tcs.2025.115272_br0220 article-title: Gathering of mobile robots with weak multiplicity detection in presence of crash-faults publication-title: J. Parallel Distrib. Comput. doi: 10.1016/j.jpdc.2018.09.015 – volume: 243 start-page: 37 year: 2015 ident: 10.1016/j.tcs.2025.115272_br0170 article-title: Fast collaborative graph exploration publication-title: Inf. Comput. doi: 10.1016/j.ic.2014.12.005 – start-page: 220 year: 1994 ident: 10.1016/j.tcs.2025.115272_br0300 article-title: An analysis of diffusive load-balancing – start-page: 1:1 year: 2018 ident: 10.1016/j.tcs.2025.115272_br0030 article-title: Dispersion of mobile robots: a study of memory-time trade-offs – ident: 10.1016/j.tcs.2025.115272_br0080 – volume: 31 start-page: 331 issue: 4 year: 1998 ident: 10.1016/j.tcs.2025.115272_br0290 article-title: First- and second-order diffusive methods for rapid, coarse, distributed load balancing publication-title: Theory Comput. Syst. doi: 10.1007/s002240000092 – volume: vol. 11931 start-page: 23 year: 2019 ident: 10.1016/j.tcs.2025.115272_br0090 article-title: Fast dispersion of mobile robots on arbitrary graphs – volume: 119 start-page: 92 year: 2018 ident: 10.1016/j.tcs.2025.115272_br0250 article-title: Uniform deployment of mobile agents in asynchronous rings publication-title: J. Parallel Distrib. Comput. doi: 10.1016/j.jpdc.2018.03.008 – ident: 10.1016/j.tcs.2025.115272_br0070 – volume: vol. 11340 year: 2019 ident: 10.1016/j.tcs.2025.115272_br0050 – volume: 345 start-page: 331 issue: 2–3 year: 2005 ident: 10.1016/j.tcs.2025.115272_br0130 article-title: Graph exploration by a finite automaton publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2005.07.014 – volume: 37 start-page: 165 issue: 3 year: 2003 ident: 10.1016/j.tcs.2025.115272_br0180 article-title: A distributed ant algorithm for efficiently patrolling a network publication-title: Algorithmica doi: 10.1007/s00453-003-1030-9 |
| SSID | ssj0000576 |
| Score | 2.454383 |
| Snippet | The dispersion problem on graphs requires k robots placed arbitrarily at the n nodes of an anonymous graph, where k≤n, to coordinate with each other to reach a... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 115272 |
| SubjectTerms | Dispersion Distributed algorithm Graph algorithm Graph exploration Mobile robot |
| Title | Dispersion of mobile robots on graphs in the asynchronous model |
| URI | https://dx.doi.org/10.1016/j.tcs.2025.115272 |
| Volume | 1044 |
| WOSCitedRecordID | wos001494057400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 0304-3975 databaseCode: AIEXJ dateStart: 20211212 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0000576 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Pb9MwFH6CjgMcBhtMdPyQDztRZcpSO3ZOqGJDA8E0iSL1Fjm2o7Xbkqnppva_5zl20mgbaCBxiSqrdqL3Oc9f7Pe-B7AnheJGCBaIPBYB1bEOMo2AGKQiOT3Ich7WicLf-MmJmEySU1-bs6rLCfCiEMtlcvVfocY2BNumzv4F3O2g2IC_EXS8Iux4fRDwh1Mr_l15InhZZvjeD-ZlVrqTgVqhumrCG2W1KpTVx7WRsHVVnC5bHXeyHJUv_zDwa2brqaszc3kuL1auONRgNJOrweF-dzchYm0sm9_iupPm4lKr7PFJ4kqctG4zdMKNd3yw2w6Y7S-UlUOPGHplFrn6PLekrX_Yge24yMPstyd7DBsRZ4nowcboy9Hk63pNZdydOvsHac6n60i9Wze6n2F0WMP4BWx6uk9GDqYteGSKbXjelNIg3rNuw7PvrXxu9RI-rjEkZU4chsRhSLDNYUimBcFOpIshqTF8BT8_H40_HQe-0kWghjRaBBmzIkGsFlcUw5wyKQUSBR4KrikuRzoyyGPDWMmQ5XmSZJkOmRxSKiNp4lgNd6BXlIV5DSRUVCOlp1KpmB5Iit-LOTVCc6UTpUXUh7CxTqq8DLytRnKRNvF-sxQNmlqDps6gffjQdrlyGih_-jNtTJ76CenIWYrz4_fddv-t2xt4up7Fb6G3mF-bd_BE3Sym1fy9n0W_AIUxabQ |
| 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=Dispersion+of+mobile+robots+on+graphs+in+the+asynchronous+model&rft.jtitle=Theoretical+computer+science&rft.au=Kshemkalyani%2C+Ajay+D.&rft.date=2025-08-01&rft.pub=Elsevier+B.V&rft.issn=0304-3975&rft.volume=1044&rft_id=info:doi/10.1016%2Fj.tcs.2025.115272&rft.externalDocID=S0304397525002105 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |