{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T21:11:16Z","timestamp":1770066676211,"version":"3.49.0"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032111265","type":"print"},{"value":"9783032111272","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T00:00:00Z","timestamp":1763424000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T00:00:00Z","timestamp":1763424000000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-11127-2_11","type":"book-chapter","created":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T20:03:55Z","timestamp":1763409835000},"page":"111-127","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing Tree Structures in\u00a0Anonymous Graphs via\u00a0Mobile Agents"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6190-4909","authenticated-orcid":false,"given":"Prabhat Kumar","family":"Chand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0414-7910","authenticated-orcid":false,"given":"Manish","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1537-3462","authenticated-orcid":false,"given":"Anisur Rahaman","family":"Molla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,18]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: A survey on sensor networks. IEEE Commun. Mag. (2002)","DOI":"10.1109\/MCOM.2002.1024422"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Augustine, J., Moses Jr, W.K.: Dispersion of mobile robots: a study of memory-time trade-offs. In: ICDCN, pp. 1:1\u20131:10 (2018)","DOI":"10.1145\/3154273.3154293"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B.: Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems. In: STOC (1987)","DOI":"10.1145\/28395.28421"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Betke, M., Rivest, R., Singh, M.: Piecemeal graph exploration by a mobile robot. Massachusetts Institute of Technology (1995)","DOI":"10.1145\/225298.225337"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Gallager, R.: A new distributed algorithm to find breadth first search trees. IEEE Trans. Inf. Theory (1987)","DOI":"10.1109\/TIT.1987.1057314"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Betke, M., Rivest, R.L., Singh, M.: Piecemeal graph exploration by a mobile robot. Inf. Comput. (1999)","DOI":"10.1006\/inco.1999.2795"},{"key":"11_CR7","unstructured":"Chand, P.K., Das, A., Molla, A.R.: Agent-based triangle counting and its applications in anonymous graphs. In: AAMAS (2024)"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Chand, P.K., Kumar, M., Molla, A.R.: Agent-driven BFS tree in anonymous graphs with applications. In: NETYS (2024)","DOI":"10.1007\/978-3-031-67321-4_4"},{"key":"11_CR9","unstructured":"Chand, P.K., Kumar, M., Molla, A.R.: Computing tree structures in anonymous graphs via mobile agents. arXiv:2506.19365 (2025)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Chand, P.K., Molla, A.R., Sivasubramaniam, S.: Run for cover: dominating set via mobile agents. In: ALGOWIN (2023)","DOI":"10.1007\/978-3-031-48882-5_10"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Cong, Y., Gu, C., Zhang, T., Gao, Y.: Underwater robot sensing technology: a survey. Fundam. Res. (2021)","DOI":"10.1016\/j.fmre.2021.03.002"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Dunbabin, M., Marques, L.: Robots for environmental monitoring: significant advancements and applications. IEEE Robot. Autom. Mag. (2012)","DOI":"10.1109\/MRA.2011.2181683"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst. (1983)","DOI":"10.1145\/357195.357200"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Garay, J., Kutten, S., Peleg, D.: A sublinear time distributed algorithm for minimum-weight spanning trees. SIAM J. Comput. (1998)","DOI":"10.1137\/S0097539794261118"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Huang, H., Savkin, A.V., Ding, M., Huang, C.: Mobile robots in wireless sensor networks: a survey on tasks. Comput. Netw. (2019)","DOI":"10.1016\/j.comnet.2018.10.018"},{"key":"11_CR16","unstructured":"Isler, V.: Robotic sensor networks for environmental monitoring. In: AAAI Spring Symposium: AI, The Fundamental Social Aggregation Challenge (2012)"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Kshemkalyani, A.D., Ali, F.: Efficient dispersion of mobile robots on graphs. In: ICDCN (2019)","DOI":"10.1145\/3288599.3288610"},{"key":"11_CR18","unstructured":"Kshemkalyani, A.D., Kumar, M., Molla, A.R., Sharma, G.: Brief announcement: agent-based leader election, MST, and beyond. In: DISC (2024)"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Kshemkalyani, A.D., Kumar, M., Molla, A.R., Sharma, G.: Faster leader election an its applications for mobile agents with parameter advice. In: ICDCIT (2025)","DOI":"10.1007\/978-3-031-81404-4_9"},{"key":"11_CR20","unstructured":"Kshemkalyani, A.D., Kumar, M., Molla, A.R., Sharma, G.: Near-linear time leader election in multiagent networks. In: AAMAS (2025)"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Kshemkalyani, A.D., Molla, A.R., Sharma, G.: Fast dispersion of mobile robots on arbitrary graphs. In: ALGOSENSORS, pp. 23\u201340 (2019)","DOI":"10.1007\/978-3-030-34405-4_2"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Kshemkalyani, A.D., Molla, A.R., Sharma, G.: Dispersion of mobile robots using global communication. J. Parallel Distrib. Comput. (2022)","DOI":"10.1016\/j.jpdc.2021.11.007"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., Trehan, A.: On the complexity of universal leader election. J. ACM 62(1), 7:1\u20137:27 (2015)","DOI":"10.1145\/2699440"},{"key":"11_CR24","unstructured":"Le Lann, G.: Distributed systems - towards a formal approach. In: IFIP (1977)"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Lee, J., Shin, S., Park, M., Kim, C.: Agent-based simulation and its application to analyze combat effectiveness in network-centric warfare considering communication failure environments. Math. Probl. Eng. (2018)","DOI":"10.1155\/2018\/2730671"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Levinas, I., Scherz, R., Louzoun, Y.: BFS-based distributed algorithm for parallel local-directed subgraph enumeration. J. Complex Netw. (2022)","DOI":"10.1093\/comnet\/cnac051"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Meivel, S., et al.: Mask detection and social distance identification using internet of things and faster R-CNN algorithm. Comput. Intell. Neurosci. (2022)","DOI":"10.1155\/2022\/2103975"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Palanisamy, V., Vijayanathan, S.: Cluster based multi agent system for breadth first search. In: ICTER (2020)","DOI":"10.1109\/ICTer51097.2020.9325464"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Pattanayak, D., Bhagat, S., Gan Chaudhuri, S., Molla, A.R.: Maximal independent set via mobile agents. In: ICDCN (2024)","DOI":"10.1145\/3631461.3631543"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Peleg, D., Rubinovich, V.: A near-tight lower bound on the time complexity of distributed MST construction. In: FOCS (1999)","DOI":"10.1137\/S0097539700369740"},{"issue":"1","key":"11_CR31","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0743-7315(90)90074-Y","volume":"8","author":"D Peleg","year":"1990","unstructured":"Peleg, D.: Time-optimal leader election in general networks. J. Parallel Distrib. Comput. 8(1), 96\u201399 (1990)","journal-title":"J. Parallel Distrib. Comput."},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Pramanick, S., Samala, S.V., Pattanayak, D., Mandal, P.S.: Filling MIS vertices of a graph by myopic luminous robots. In: ICDCIT (2023)","DOI":"10.1007\/978-3-031-24848-1_1"},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"Rihan, M., Selim, M.M., Xu, C., Huang, L.: D2D communication underlaying UAV on multiple bands in disaster area: stochastic geometry analysis. IEEE Access (2019)","DOI":"10.1109\/ACCESS.2019.2949813"},{"issue":"10","key":"11_CR34","doi-asserted-by":"publisher","first-page":"2073","DOI":"10.1007\/s12541-015-0269-9","volume":"16","author":"H Ryu","year":"2015","unstructured":"Ryu, H., Chung, W.K.: Local map-based exploration using a breadth-first search algorithm for mobile robots. Int. J. Precis. Eng. Manuf. 16(10), 2073\u20132080 (2015). https:\/\/doi.org\/10.1007\/s12541-015-0269-9","journal-title":"Int. J. Precis. Eng. Manuf."},{"key":"11_CR35","unstructured":"Spira, P.: Communication complexity of distributed minimum spanning tree algorithms. In: Proceedings of the Second Berkeley Conference on Distributed Data Management and Computer Networks (1977)"},{"key":"11_CR36","unstructured":"Sudo, Y., Shibata, M., Nakamura, J., Kim, Y., Masuzawa, T.: Near-linear time dispersion of mobile agents. In: DISC (2024)"},{"key":"11_CR37","doi-asserted-by":"crossref","unstructured":"Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences. ACM Trans. Algorithms (2014)","DOI":"10.1145\/2601068"},{"key":"11_CR38","doi-asserted-by":"crossref","unstructured":"Wilk-Jakubowski, G., Harabin, R., Ivanov, S.: Robotics in crisis management: a review. Technol. Soc. (2022)","DOI":"10.1016\/j.techsoc.2022.101935"},{"key":"11_CR39","doi-asserted-by":"crossref","unstructured":"Wu, M.: Robotics applications in natural hazards. Highlights in Science, Engineering and Technology (2023)","DOI":"10.54097\/hset.v43i.7429"},{"key":"11_CR40","doi-asserted-by":"crossref","unstructured":"Zhao, N., et al.: UAV-assisted emergency networks in disasters. IEEE Wirel. Commun. (2019)","DOI":"10.1109\/MWC.2018.1800160"},{"key":"11_CR41","doi-asserted-by":"crossref","unstructured":"Zhuge, C., Shao, C., Wei, B.: An agent-based spatial urban social network generator: a case study of Beijing, China. J. Comput. Sci. (2018)","DOI":"10.1016\/j.jocs.2018.09.005"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-11127-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T20:04:01Z","timestamp":1763409841000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11127-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,18]]},"ISBN":["9783032111265","9783032111272"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11127-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,18]]},"assertion":[{"value":"18 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kathmandu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nepal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}