{"id":"https://openalex.org/W4408086321","doi":"https://doi.org/10.1080/17445760.2025.2469514","title":"Memory optimal distance-2-dispersion with termination","display_name":"Memory optimal distance-2-dispersion with termination","publication_year":2025,"publication_date":"2025-03-02","ids":{"openalex":"https://openalex.org/W4408086321","doi":"https://doi.org/10.1080/17445760.2025.2469514"},"language":"en","primary_location":{"id":"doi:10.1080/17445760.2025.2469514","is_oa":false,"landing_page_url":"https://doi.org/10.1080/17445760.2025.2469514","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192","1744-5760","1744-5779"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Parallel, Emergent and Distributed Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008550148","display_name":"Tanvir Kaur","orcid":"https://orcid.org/0000-0002-4270-137X"},"institutions":[{"id":"https://openalex.org/I119241673","display_name":"Indian Institute of Technology Ropar","ror":"https://ror.org/02qkhhn56","country_code":"IN","type":"education","lineage":["https://openalex.org/I119241673"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Tanvir Kaur","raw_affiliation_strings":["Indian Institute of Technology Ropar"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Ropar","institution_ids":["https://openalex.org/I119241673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059765803","display_name":"Kaushik Mondal","orcid":"https://orcid.org/0000-0002-9606-9293"},"institutions":[{"id":"https://openalex.org/I119241673","display_name":"Indian Institute of Technology Ropar","ror":"https://ror.org/02qkhhn56","country_code":"IN","type":"education","lineage":["https://openalex.org/I119241673"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Kaushik Mondal","raw_affiliation_strings":["Indian Institute of Technology Ropar"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Ropar","institution_ids":["https://openalex.org/I119241673"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5059765803"],"corresponding_institution_ids":["https://openalex.org/I119241673"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04254175,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"41","issue":"2","first_page":"253","last_page":"274"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7424180507659912},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3664613366127014}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7424180507659912},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3664613366127014}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/17445760.2025.2469514","is_oa":false,"landing_page_url":"https://doi.org/10.1080/17445760.2025.2469514","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192","1744-5760","1744-5779"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Parallel, Emergent and Distributed Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1346022561","display_name":null,"funder_award_id":"SR/FST/MS-I/2018/22(C)","funder_id":"https://openalex.org/F4320320719","funder_display_name":"Department of Science and Technology, Ministry of Science and Technology, India"},{"id":"https://openalex.org/G2823405884","display_name":null,"funder_award_id":"09/1005(0048)/2020-EMR-I","funder_id":"https://openalex.org/F4320320721","funder_display_name":"Council of Scientific and Industrial Research, India"}],"funders":[{"id":"https://openalex.org/F4320320719","display_name":"Department of Science and Technology, Ministry of Science and Technology, India","ror":"https://ror.org/0101xrq71"},{"id":"https://openalex.org/F4320320721","display_name":"Council of Scientific and Industrial Research, India","ror":"https://ror.org/021wm7p51"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1957963525","https://openalex.org/W1964089073","https://openalex.org/W1969099455","https://openalex.org/W2015331738","https://openalex.org/W2071114738","https://openalex.org/W2074687256","https://openalex.org/W2091969952","https://openalex.org/W2467514673","https://openalex.org/W2776603735","https://openalex.org/W2909916866","https://openalex.org/W2934894069","https://openalex.org/W2953390354","https://openalex.org/W2962810070","https://openalex.org/W2963426245","https://openalex.org/W2963714020","https://openalex.org/W2963870167","https://openalex.org/W2984471501","https://openalex.org/W3046858779","https://openalex.org/W3106687373","https://openalex.org/W3168734391","https://openalex.org/W3177377911","https://openalex.org/W3183798905","https://openalex.org/W4200366677","https://openalex.org/W4229705835","https://openalex.org/W4312392439","https://openalex.org/W4383334996","https://openalex.org/W4386786275","https://openalex.org/W4390843489","https://openalex.org/W4391095687","https://openalex.org/W6811082671"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"The":[0,208,225],"aim":[1],"of":[2,11,18,23,45,58,73,111,204,277,288,329,350,364,376],"the":[3,16,29,46,49,59,88,93,109,121,153,195,205,231,257,278,285,289,297,301,305,316,320,324,342,356,362,365,368,374,382],"dispersion":[4,60],"problem":[5,375],"is":[6,114,125,149,184,192,211,311,334],"to":[7,131,136,169,176,187,303,322],"place":[8,186],"a":[9,56,133,145,156,167,200,212,251,348],"set":[10,148,203],"k(\u2264n)":[12],"mobile":[13],"robots":[14,47,86,100,112,175,198,226,237,258,302,321,357],"in":[15,28,64,87,230,367,378,381],"nodes":[17,25,84,98,154,180,196,217,222,343,363],"an":[19,77,244],"unknown":[20],"graph":[21,209,214,279,366],"consisting":[22],"n":[24,216,282],"such":[26],"that":[27,80,123,194,246,315,340],"final":[30,89],"configuration":[31,44,253],"each":[32,129,328],"node":[33,135,168],"contains":[34],"at":[35,103,361],"most":[36],"one":[37],"robot,":[38,271],"starting":[39,249],"from":[40,250],"any":[41,71,96,160,274],"arbitrary":[42],"initial":[43,369],"on":[48,178,296],"graph.":[50,290],"In":[51],"this":[52],"work,":[53],"we":[54,68,172],"propose":[55],"variant":[57],"problem,":[61,326],"namely":[62],"Distance-2-Dispersion,":[63],"short,":[65],"D-2-D,":[66],"where":[67,221,234],"start":[69],"with":[70,99,197,215,347],"number":[72,110],"robots,":[74],"and":[75,218,261,283],"put":[76],"additional":[78],"constraint":[79],"no":[81,185],"two":[82,97],"adjacent":[83],"contain":[85],"configuration.":[90],"That":[91],"is,":[92],"distance":[94],"between":[95],"must":[101],"be":[102,120],"least":[104],"2.":[105],"However,":[106],"even":[107,354],"if":[108,144,182,341,355],"k":[113],"less":[115],"than":[116],"n,":[117],"it":[118,124,191],"might":[119],"case":[122],"not":[126,165],"possible":[127],"for":[128],"robot":[130,157,163],"find":[132,166],"distinct":[134],"reside,":[137],"maintaining":[138],"our":[139,309],"added":[140],"constraint.":[141],"More":[142],"specifically,":[143],"maximal":[146,201],"independent":[147,202],"already":[150],"formed":[151],"by":[152,300,319],"containing":[155],"each,":[158],"then":[159,353],"other":[161],"unsettled":[162],"will":[164],"settle.":[170],"Hence":[171],"allow":[173],"multiple":[174],"sit":[177],"some":[179],"only":[181],"there":[183],"sit.":[188],"If":[189],"k\u2265n,":[190],"guaranteed":[193],"form":[199],"underlying":[206],"network.":[207],"G=(V,E)":[210],"port-labeled":[213],"m":[219],"edges,":[220],"are":[223,259,344,358],"anonymous.":[224],"have":[227,331],"unique":[228],"IDs":[229],"range":[232],"[1,L],":[233],"L\u2265k.":[235],"Co-located":[236],"can":[238,372],"communicate":[239],"among":[240],"themselves.":[241],"We":[242,291,313,337],"provide":[243,292],"algorithm":[245,310],"solves":[247],"D-2-D":[248,306,325,377],"rooted":[252],"(i.e.":[254],"initially":[255],"all":[256],"co-located)":[260],"terminates":[262],"after":[263],"2\u0394(8m\u22123n+3)":[264],"synchronous":[265],"rounds":[266,380],"using":[267,273],"O(log\u2061n)":[268,332,351],"memory":[269,298],"per":[270],"without":[272],"global":[275],"knowledge":[276],"parameters":[280],"m,":[281],"\u0394,":[284],"maximum":[286],"degree":[287],"\u03a9(log\u2061n)":[293],"lower":[294],"bound":[295],"requirement":[299],"solve":[304,323,373],"problem.":[307],"Thus":[308],"memory-optimal.":[312],"conjecture":[314],"time":[317],"required":[318],"provided":[327],"them":[330],"memory,":[333],"\u03a9(m\u0394)":[335],"rounds.":[336],"further":[338],"show":[339],"also":[345],"equipped":[346],"storage":[349],"bits,":[352],"arbitrarily":[359],"positioned":[360],"configuration,":[370],"they":[371],"2\u0394(8m\u22123n+3)+8m":[379],"same":[383],"setting.":[384]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}