{"id":"https://openalex.org/W4416288547","doi":"https://doi.org/10.1007/978-3-032-11127-2_11","title":"Computing Tree Structures in\u00a0Anonymous Graphs via\u00a0Mobile Agents","display_name":"Computing Tree Structures in\u00a0Anonymous Graphs via\u00a0Mobile Agents","publication_year":2025,"publication_date":"2025-11-17","ids":{"openalex":"https://openalex.org/W4416288547","doi":"https://doi.org/10.1007/978-3-032-11127-2_11"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-032-11127-2_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-032-11127-2_11","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5056758034","display_name":"Prabhat Kumar Chand","orcid":"https://orcid.org/0000-0001-6190-4909"},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Prabhat Kumar Chand","raw_affiliation_strings":["Indian Statistical Institute, Kolkata, India"],"raw_orcid":"https://orcid.org/0000-0001-6190-4909","affiliations":[{"raw_affiliation_string":"Indian Statistical Institute, Kolkata, India","institution_ids":["https://openalex.org/I6498739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006344213","display_name":"Manish Kumar","orcid":"https://orcid.org/0000-0002-0414-7910"},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"education","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Manish Kumar","raw_affiliation_strings":["Indian Institute of Technology, Madras, Chennai, India"],"raw_orcid":"https://orcid.org/0000-0002-0414-7910","affiliations":[{"raw_affiliation_string":"Indian Institute of Technology, Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018807670","display_name":"Anisur Rahaman Molla","orcid":"https://orcid.org/0000-0002-1537-3462"},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Anisur Rahaman Molla","raw_affiliation_strings":["Indian Statistical Institute, Kolkata, India"],"raw_orcid":"https://orcid.org/0000-0002-1537-3462","affiliations":[{"raw_affiliation_string":"Indian Statistical Institute, Kolkata, India","institution_ids":["https://openalex.org/I6498739"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5056758034"],"corresponding_institution_ids":["https://openalex.org/I6498739"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.9814,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.88414679,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"111","last_page":"127"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.5814999938011169,"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"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.5814999938011169,"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/T12288","display_name":"Optimization and Search Problems","score":0.3930000066757202,"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.003100000089034438,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.593500018119812},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5737000107765198},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5160999894142151},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.51419997215271},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.4507000148296356},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.45010000467300415},{"id":"https://openalex.org/keywords/root","display_name":"Root (linguistics)","score":0.4302999973297119},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3928999900817871},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.39169999957084656},{"id":"https://openalex.org/keywords/leader-election","display_name":"Leader election","score":0.3752000033855438}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8539999723434448},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.593500018119812},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5737000107765198},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5160999894142151},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.51419997215271},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5004000067710876},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.4507000148296356},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.45010000467300415},{"id":"https://openalex.org/C171078966","wikidata":"https://www.wikidata.org/wiki/Q111029","display_name":"Root (linguistics)","level":2,"score":0.4302999973297119},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39649999141693115},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3928999900817871},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.39169999957084656},{"id":"https://openalex.org/C53480672","wikidata":"https://www.wikidata.org/wiki/Q1424189","display_name":"Leader election","level":2,"score":0.3752000033855438},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.3752000033855438},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3702000081539154},{"id":"https://openalex.org/C84875433","wikidata":"https://www.wikidata.org/wiki/Q3277848","display_name":"Mobile agent","level":2,"score":0.35280001163482666},{"id":"https://openalex.org/C2781018962","wikidata":"https://www.wikidata.org/wiki/Q5164884","display_name":"Container (type theory)","level":2,"score":0.3490000069141388},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.3433000147342682},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.3402999937534332},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.337799996137619},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.33079999685287476},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.3273000121116638},{"id":"https://openalex.org/C163736687","wikidata":"https://www.wikidata.org/wiki/Q17014592","display_name":"Fractal tree index","level":5,"score":0.31139999628067017},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.3111000061035156},{"id":"https://openalex.org/C94557470","wikidata":"https://www.wikidata.org/wiki/Q2377385","display_name":"Segment tree","level":5,"score":0.3003000020980835},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.2996000051498413},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.29440000653266907},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.28119999170303345},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.27959999442100525},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.27410000562667847},{"id":"https://openalex.org/C124343487","wikidata":"https://www.wikidata.org/wiki/Q1046373","display_name":"Critical section","level":2,"score":0.27300000190734863},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2694000005722046},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.2685000002384186}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-032-11127-2_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-032-11127-2_11","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1989793404","https://openalex.org/W2015819397","https://openalex.org/W2024957346","https://openalex.org/W2025827262","https://openalex.org/W2042437235","https://openalex.org/W2053788000","https://openalex.org/W2059015573","https://openalex.org/W2072931689","https://openalex.org/W2077371116","https://openalex.org/W2114858735","https://openalex.org/W2130403046","https://openalex.org/W2163097371","https://openalex.org/W2285418055","https://openalex.org/W2891298109","https://openalex.org/W2898731180","https://openalex.org/W2901790394","https://openalex.org/W2903617657","https://openalex.org/W2963426245","https://openalex.org/W2963870167","https://openalex.org/W2982369260","https://openalex.org/W2984471501","https://openalex.org/W3126384976","https://openalex.org/W3137746387","https://openalex.org/W4200366677","https://openalex.org/W4210782672","https://openalex.org/W4213336194","https://openalex.org/W4310491021","https://openalex.org/W4313731755","https://openalex.org/W4366777813","https://openalex.org/W4389264790","https://openalex.org/W4391095687","https://openalex.org/W4401842911","https://openalex.org/W4405900948"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-11-17T00:00:00"}