{"id":"https://openalex.org/W3023520383","doi":"https://doi.org/10.1142/s012905412050015x","title":"Convergecast Tree on Temporal Graphs","display_name":"Convergecast Tree on Temporal Graphs","publication_year":2020,"publication_date":"2020-04-01","ids":{"openalex":"https://openalex.org/W3023520383","doi":"https://doi.org/10.1142/s012905412050015x","mag":"3023520383"},"language":"en","primary_location":{"id":"doi:10.1142/s012905412050015x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905412050015x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5013625305","display_name":"Subhrangsu Mandal","orcid":"https://orcid.org/0000-0002-0957-492X"},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Subhrangsu Mandal","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, Kharagpur, West Bengal 721302, India"],"raw_orcid":"https://orcid.org/0000-0002-0957-492X","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, Kharagpur, West Bengal 721302, India","institution_ids":["https://openalex.org/I145894827"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111977677","display_name":"Arobinda Gupta","orcid":null},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Arobinda Gupta","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, Kharagpur, West Bengal 721302, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, Kharagpur, West Bengal 721302, India","institution_ids":["https://openalex.org/I145894827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5013625305"],"corresponding_institution_ids":["https://openalex.org/I145894827"],"apc_list":null,"apc_paid":null,"fwci":0.3237,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.61227162,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"31","issue":"03","first_page":"385","last_page":"409"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":1.0,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":1.0,"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9994000196456909,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9984999895095825,"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/computer-science","display_name":"Computer science","score":0.597448468208313},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5873556733131409},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5660386681556702},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.514067530632019},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49649864435195923},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.4896862804889679},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4883112907409668},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.48802486062049866},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.46169742941856384},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.4418136477470398},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3634902238845825},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3316689431667328},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3288962244987488},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3088732659816742},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.276966392993927},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2121126353740692},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12385186553001404}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.597448468208313},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5873556733131409},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5660386681556702},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.514067530632019},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49649864435195923},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.4896862804889679},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4883112907409668},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.48802486062049866},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.46169742941856384},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4418136477470398},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3634902238845825},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3316689431667328},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3288962244987488},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3088732659816742},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.276966392993927},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2121126353740692},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12385186553001404},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s012905412050015x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905412050015x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1626706218","https://openalex.org/W1746637951","https://openalex.org/W1945448203","https://openalex.org/W1975507024","https://openalex.org/W1982459859","https://openalex.org/W1982467666","https://openalex.org/W1984196269","https://openalex.org/W1986909918","https://openalex.org/W2011039300","https://openalex.org/W2055518297","https://openalex.org/W2085128250","https://openalex.org/W2086991377","https://openalex.org/W2096509679","https://openalex.org/W2111708605","https://openalex.org/W2118791982","https://openalex.org/W2125486908","https://openalex.org/W2132518522","https://openalex.org/W2142502714","https://openalex.org/W2149349114","https://openalex.org/W2149742236","https://openalex.org/W2155956719","https://openalex.org/W2162076967","https://openalex.org/W2166660524","https://openalex.org/W2186094217","https://openalex.org/W2244843312","https://openalex.org/W2512030869","https://openalex.org/W2523642225","https://openalex.org/W2803242190","https://openalex.org/W2963228704","https://openalex.org/W2973410199"],"related_works":["https://openalex.org/W1524393328","https://openalex.org/W2739242419","https://openalex.org/W4244816249","https://openalex.org/W2150253898","https://openalex.org/W1595291551","https://openalex.org/W2021517364","https://openalex.org/W2183636263","https://openalex.org/W2045906087","https://openalex.org/W3042441286","https://openalex.org/W2090953203"],"abstract_inverted_index":{"Temporal":[0],"graphs":[1,28],"are":[2,53],"useful":[3,56],"tools":[4],"to":[5,72,160],"model":[6],"dynamic":[7,33],"network":[8],"topologies":[9],"found":[10],"in":[11,32,123],"many":[12],"applications.":[13],"In":[14],"this":[15],"paper,":[16],"we":[17],"address":[18,161],"the":[19,85,93,102,105,124,135],"problem":[20,136],"of":[21,38,87,95,104,137],"constructing":[22,138],"a":[23,74,139],"convergecast":[24,39,44,51,78,144],"tree":[25,45,52,145],"on":[26,170],"temporal":[27,107],"for":[29,58],"data":[30,61,174],"collection":[31],"sensor":[34],"networks.":[35],"Two":[36],"types":[37],"trees,":[40],"bounded":[41,75],"arrival":[42,49,76,142],"time":[43,50,67,77,143,153],"and":[46,97,116,148],"minimum":[47,140],"total":[48,141],"defined":[54],"as":[55],"structures":[57],"low":[59],"delay":[60],"collection.":[62],"An":[63],"[Formula:":[64,81,89,98,150],"see":[65,82,90,99,151],"text]":[66,83,91,100,152],"centralized":[68],"algorithm":[69,110,115,157,165],"is":[70,84,92,101,112,127,131,146,158,166],"proposed":[71,159],"construct":[73],"tree,":[79],"where":[80],"number":[86,94],"nodes,":[88],"edges,":[96],"lifetime":[103],"given":[106],"graph.":[108],"The":[109,163],"presented":[111],"an":[113,149],"offline":[114,155],"assumes":[117],"that":[118,134],"all":[119],"information":[120],"about":[121],"change":[122],"graph":[125],"topology":[126],"known":[128],"apriori.":[129],"It":[130],"then":[132],"shown":[133],"NP-complete,":[147],"centralized,":[154],"heuristic":[156,164],"it.":[162],"evaluated":[167],"with":[168],"experiments":[169],"four":[171],"real":[172],"life":[173],"sets.":[175]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}