{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:50:11Z","timestamp":1743155411699,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031814037"},{"type":"electronic","value":"9783031814044"}],"license":[{"start":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T00:00:00Z","timestamp":1735603200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T00:00:00Z","timestamp":1735603200000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-81404-4_8","type":"book-chapter","created":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T00:38:50Z","timestamp":1735605530000},"page":"92-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mobile Agents on\u00a0Chordal Graphs: Maximum Independent Set and\u00a0Beyond"],"prefix":"10.1007","author":[{"given":"Tanvir","family":"Kaur","sequence":"first","affiliation":[]},{"given":"Kaustav","family":"Paul","sequence":"additional","affiliation":[]},{"given":"Kaushik","family":"Mondal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,31]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/2945.675649","volume":"4","author":"JT Klosowski","year":"1998","unstructured":"Klosowski, J.T., Held, M., Mitchell, J.S.B., Sowizral, H., Zikan, K.: Efficient collision detection using bounding volume hierarchies of k-DoPs. IEEE Trans. Visual Comput. Graphics 4, 21\u201336 (1998)","journal-title":"IEEE Trans. Visual Comput. Graphics"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-48481-7_37","volume-title":"Algorithms - ESA\u2019 99","author":"B Verweij","year":"1999","unstructured":"Verweij, B., Aardal, K.: An optimisation algorithm for maximum independent set with applications in map labelling. In: Ne\u0161et\u0159il, J. (ed.) ESA 1999. LNCS, vol. 1643, pp. 426\u2013437. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48481-7_37"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1007\/s40305-022-00395-8","volume":"11","author":"R Montemanni","year":"2023","unstructured":"Montemanni, R., Smith, D.H., Chou, X.C.: Maximum independent sets and supervised learning. J. Oper. Res. Soc. China 11, 957\u2013972 (2023)","journal-title":"J. Oper. Res. Soc. China"},{"key":"8_CR4","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1307","volume":"9","author":"SM Ghafari","year":"2019","unstructured":"Ghafari, S.M., Tjortjis, C.: A survey on association rules mining using heuristics. WIREs Data Min. Knowl. Discovery 9, e1307 (2019)","journal-title":"WIREs Data Min. Knowl. Discovery"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N Alon","year":"1986","unstructured":"Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms 7, 567\u2013583 (1986)","journal-title":"J. Algorithms"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput. 21, 193\u2013201 (1992)","journal-title":"SIAM J. Comput."},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M Luby","year":"1986","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15, 1036\u20131053 (1986)","journal-title":"SIAM J. Comput."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Pattanayak, D., Bhagat, S., Chaudhuri, S.G., Molla, A.R.: Maximal independent set via mobile agents. In: ICDCN 2024, pp. 74\u201383 (2024)","DOI":"10.1145\/3631461.3631543"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Gorain, B., Kaur, T., Mondal, K.: Distance-2-dispersion with termination by a strong team. In: CALDAM, vol. 14508, pp. 44\u201358 (2024)","DOI":"10.1007\/978-3-031-52213-0_4"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Chand, P.K., Molla, A.R., Sivasubramaniam, S.: Run for cover: dominating set via mobile agents. In: ALGOWIN, vol. 14061, pp. 133\u2013150 (2023)","DOI":"10.1007\/978-3-031-48882-5_10"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Barenboim, L., Elkin, M., Pettie, S., Schneider, J.: The locality of distributed symmetry breaking. J. ACM 63, 20:1\u201320:45 (2016)","DOI":"10.1145\/2903137"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Fischer, M., Noever, A.: Tight analysis of parallel randomized greedy MIS. In: SODA, pp. 2152\u20132160 (2018)","DOI":"10.1137\/1.9781611975031.140"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Ghaffari, M.: An improved distributed algorithm for maximal independent set. In: SODA, pp. 270\u2013277 (2016)","DOI":"10.1137\/1.9781611974331.ch20"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Harris, D.G., Schneider, J., Su, H.H.: Distributed ($$\\Delta +1$$)-coloring in sublogarithmic rounds. In: STOC, pp. 465\u2013478 (2016)","DOI":"10.1145\/2897518.2897533"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: Local computation: lower and upper bounds. J. ACM 63, 17:1\u201317:44 (2016)","DOI":"10.1145\/2742012"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Bodlaender, M.H.L., Halld\u00f3rsson, M.M., Konrad, C., Kuhn, F.: Brief announcement: local independent set approximation. In: PODC, pp. 93\u201395 (2016)","DOI":"10.1145\/2933057.2933068"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Czygrinow, A., Ha\u0144\u0107kowiak, M., Wawrzyniak, W.: Fast distributed approximations in planar graphs. In: DISC, pp. 78\u201392 (2008)","DOI":"10.1007\/978-3-540-87779-0_6"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M.M., Konrad, C.: Distributed large independent sets in one round on bounded-independence graphs. In: DISC, pp. 559\u2013572 (2015)","DOI":"10.1007\/978-3-662-48653-5_37"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s00446-010-0097-1","volume":"22","author":"J Schneider","year":"2010","unstructured":"Schneider, J., Wattenhofer, R.: An optimal maximal independent set algorithm for bounded-independence graphs. Distrib. Comput. 22, 349\u2013361 (2010)","journal-title":"Distrib. Comput."},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.jpdc.2019.05.012","volume":"132","author":"AR Molla","year":"2019","unstructured":"Molla, A.R., Pandit, S., Roy, S.: Optimal deterministic distributed algorithms for maximal independent set in geometric graphs. J. Parallel Distributed Comput. 132, 36\u201347 (2019)","journal-title":"J. Parallel Distributed Comput."},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"223","DOI":"10.7155\/jgaa.00354","volume":"19","author":"V Turau","year":"2015","unstructured":"Turau, V., K\u00f6hler, S.: A distributed algorithm for minimum distance-k domination in trees. J. Graph Algorithms Appl. 19, 223\u2013242 (2015)","journal-title":"J. Graph Algorithms Appl."},{"key":"8_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114187","volume":"978","author":"S Pramanick","year":"2023","unstructured":"Pramanick, S., Samala, S.V., Pattanayak, D., Mandal, P.S.: Distributed algorithms for filling MIS vertices of an arbitrary graph by myopic luminous robots. TCS 978, 114187 (2023)","journal-title":"TCS"},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1093\/comjnl\/bxac158","volume":"67","author":"S Kamei","year":"2024","unstructured":"Kamei, S., Tixeuil, S.: An asynchronous maximum independent set algorithm by myopic luminous robots on grids. Comput. J. 67, 57\u201377 (2024)","journal-title":"Comput. J."},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","volume":"32","author":"DJ Rose","year":"1970","unstructured":"Rose, D.J.: Triangulated graphs and the elimination process. J. Math. Anal. Appl. 32, 597\u2013609 (1970)","journal-title":"J. Math. Anal. Appl."},{"key":"8_CR25","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F Gavril","year":"1972","unstructured":"Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM J. Comput. 1, 180\u2013187 (1972)","journal-title":"SIAM J. Comput."},{"key":"8_CR26","unstructured":"Augustine, J., Moses Jr, W.K.: Dispersion of mobile robots: a study of memory-time trade-offs. In: ICDCN 2018, pp. 1:1\u20131:10 (2018)"},{"key":"8_CR27","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01934098","volume":"28","author":"G Chen","year":"1988","unstructured":"Chen, G., Kuo, M., Sheu, J.P.: An optimal time algorithm for finding a maximum weight independent set in a tree. BIT 28, 353\u2013356 (1988)","journal-title":"BIT"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Intelligent Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-81404-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T01:03:43Z","timestamp":1735607023000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-81404-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,31]]},"ISBN":["9783031814037","9783031814044"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-81404-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,31]]},"assertion":[{"value":"31 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICDCIT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Distributed Computing and Intelligent Technology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhubaneswar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"8 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icdcit2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icdcit.ac.in","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}