{"id":"https://openalex.org/W3211245715","doi":"https://doi.org/10.1109/icccnt51525.2021.9580066","title":"Disjoint Set Union for Trees","display_name":"Disjoint Set Union for Trees","publication_year":2021,"publication_date":"2021-07-06","ids":{"openalex":"https://openalex.org/W3211245715","doi":"https://doi.org/10.1109/icccnt51525.2021.9580066","mag":"3211245715"},"language":"en","primary_location":{"id":"doi:10.1109/icccnt51525.2021.9580066","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccnt51525.2021.9580066","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 12th International Conference on Computing Communication and Networking Technologies (ICCCNT)","raw_type":"proceedings-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/A5013847478","display_name":"Amit Kumar Yadav","orcid":"https://orcid.org/0000-0003-2577-7097"},"institutions":[{"id":"https://openalex.org/I863896202","display_name":"Delhi Technological University","ror":"https://ror.org/01ztcvt22","country_code":"IN","type":"education","lineage":["https://openalex.org/I863896202"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Amit Yadav","raw_affiliation_strings":["Delhi Technological University, Delhi, India"],"affiliations":[{"raw_affiliation_string":"Delhi Technological University, Delhi, India","institution_ids":["https://openalex.org/I863896202"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051437332","display_name":"Harsh Shokeen","orcid":null},"institutions":[{"id":"https://openalex.org/I863896202","display_name":"Delhi Technological University","ror":"https://ror.org/01ztcvt22","country_code":"IN","type":"education","lineage":["https://openalex.org/I863896202"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Harsh Shokeen","raw_affiliation_strings":["Delhi Technological University, Delhi, India"],"affiliations":[{"raw_affiliation_string":"Delhi Technological University, Delhi, India","institution_ids":["https://openalex.org/I863896202"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039550378","display_name":"Jitesh Yadav","orcid":null},"institutions":[{"id":"https://openalex.org/I863896202","display_name":"Delhi Technological University","ror":"https://ror.org/01ztcvt22","country_code":"IN","type":"education","lineage":["https://openalex.org/I863896202"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Jitesh Yadav","raw_affiliation_strings":["Delhi Technological University, Delhi, India"],"affiliations":[{"raw_affiliation_string":"Delhi Technological University, Delhi, India","institution_ids":["https://openalex.org/I863896202"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5013847478"],"corresponding_institution_ids":["https://openalex.org/I863896202"],"apc_list":null,"apc_paid":null,"fwci":0.2959,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.62746009,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9976999759674072,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9976999759674072,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9955000281333923,"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/T11106","display_name":"Data Management and Algorithms","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/disjoint-sets","display_name":"Disjoint sets","score":0.6647769212722778},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5949923396110535},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5232235789299011},{"id":"https://openalex.org/keywords/disjoint-union","display_name":"Disjoint union (topology)","score":0.48670271039009094},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.19816854596138},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1676168143749237},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.16583898663520813}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6647769212722778},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5949923396110535},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5232235789299011},{"id":"https://openalex.org/C7655956","wikidata":"https://www.wikidata.org/wiki/Q5282259","display_name":"Disjoint union (topology)","level":2,"score":0.48670271039009094},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.19816854596138},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1676168143749237},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.16583898663520813}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icccnt51525.2021.9580066","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccnt51525.2021.9580066","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 12th International Conference on Computing Communication and Networking Technologies (ICCCNT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.4300000071525574,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W2019579910","https://openalex.org/W2028503265","https://openalex.org/W2047233027","https://openalex.org/W2057945184","https://openalex.org/W2099096599","https://openalex.org/W2101344335","https://openalex.org/W2118810554","https://openalex.org/W2124608963","https://openalex.org/W2129095048","https://openalex.org/W2137341603","https://openalex.org/W2151028259","https://openalex.org/W2159293599","https://openalex.org/W2501233964","https://openalex.org/W2962217072","https://openalex.org/W3046212195","https://openalex.org/W6765981385"],"related_works":["https://openalex.org/W55187247","https://openalex.org/W2058834578","https://openalex.org/W1891636518","https://openalex.org/W264408731","https://openalex.org/W2073363580","https://openalex.org/W411819533","https://openalex.org/W2067430117","https://openalex.org/W2213612705","https://openalex.org/W2004734763","https://openalex.org/W1972516737"],"abstract_inverted_index":{"The":[0],"Disjoint":[1,176,178],"Set":[2,179],"Union":[3,180],"(DSU)":[4],"for":[5,113,135,152,165,181,202,232,250],"Trees":[6],"can":[7,146],"be":[8,142,147],"used":[9,188],"to":[10,53,65,90],"solve":[11],"a":[12,32,37,45],"lot":[13],"of":[14,22,31,57,71,87,97,128,172,244,258],"problems.":[15],"It":[16],"is":[17,73,107,125,167],"effective":[18],"in":[19,28,116,130,189],"solving":[20],"problems":[21,72,145],"the":[23,29,49,55,95,104,126,170,175,184,193,204,217,221,256],"type:":[24],"How":[25],"many":[26,86],"vertices":[27],"subtree":[30],"vertex":[33],"V":[34],"are":[35,100,208,226],"following":[36,103],"particular":[38],"property?":[39],"For":[40,191],"an":[41],"organization":[42],"that":[43,248],"follows":[44],"Hierarchical":[46],"employee":[47],"structure,":[48],"administration":[50],"might":[51],"want":[52],"know":[54],"number":[56,96,127],"employees":[58,129],"working":[59,79],"under":[60,80],"Manager":[61],"\u2018M\u2019":[62,81],"who":[63],"belongs":[64,89],"city":[66,91],"\u2018C\u2019?":[67],"Conventionally":[68],"such":[69,98,137],"sort":[70],"solved":[74,149],"by":[75],"considering":[76],"every":[77],"individual":[78],"and":[82,133,199,228,234,242],"then":[83,102],"seeing":[84],"how":[85],"them":[88],"\u2018C\u2019,":[92],"but":[93,210],"when":[94],"queries":[99,138],"high":[101],"conventional":[105],"approach":[106,246],"not":[108],"at":[109],"all":[110],"feasible":[111],"as":[112,187,215],"each":[114,245],"query":[115],"worst":[117],"case":[118],"it":[119],"takes":[120,252],"O(N)":[121],"time":[122,139,155],"where":[123],"N":[124],"hierarchical":[131],"structure":[132,186,194],"therefore":[134],"Q":[136],"complexity":[140,156],"will":[141],"O(N*Q).":[143],"Such":[144],"effectively":[148,173],"using":[150],"DSU":[151,164,231,249],"trees":[153,182,203,233],"with":[154],"O(Q":[157],"+N*":[158],"Log":[159],"<inf":[160],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[161],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</inf>":[162],"(N)).":[163],"Tree":[166,251],"based":[168],"on":[169],"idea":[171],"merging":[174],"Sets.":[177],"uses":[183],"same":[185,205],"graphs.":[190],"graphs,":[192],"has":[195],"two":[196,206,235],"methods:":[197],"unite":[198],"getParent.":[200],"Similarly,":[201],"methods":[207],"applicable":[209],"their":[211],"definition":[212],"gets":[213],"tweaked":[214],"per":[216],"applicability.":[218],"To":[219],"validate":[220],"performance":[222],"some":[223],"data":[224],"sets":[225],"generated":[227],"solution":[229],"involving":[230],"other":[236],"brute":[237,259],"force":[238,260],"approaches":[239],"were":[240],"executed":[241],"runtime":[243,257],"suggests":[247],"approximately":[253],"(Log(N)/N)":[254],"times":[255],"approaches.":[261]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}