{"id":"https://openalex.org/W4283326737","doi":"https://doi.org/10.14778/3514061.3514063","title":"A near-optimal approach to edge connectivity-based hierarchical graph decomposition","display_name":"A near-optimal approach to edge connectivity-based hierarchical graph decomposition","publication_year":2022,"publication_date":"2022-02-01","ids":{"openalex":"https://openalex.org/W4283326737","doi":"https://doi.org/10.14778/3514061.3514063"},"language":"en","primary_location":{"id":"doi:10.14778/3514061.3514063","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3514061.3514063","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","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/A5037530341","display_name":"Lijun Chang","orcid":"https://orcid.org/0000-0002-6830-3900"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"The University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Lijun Chang","raw_affiliation_strings":["The University of Sydney"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Sydney","institution_ids":["https://openalex.org/I129604602"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100645267","display_name":"Zhiyi Wang","orcid":"https://orcid.org/0000-0001-7112-9862"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"The University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Zhiyi Wang","raw_affiliation_strings":["The University of Sydney"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Sydney","institution_ids":["https://openalex.org/I129604602"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5037530341"],"corresponding_institution_ids":["https://openalex.org/I129604602"],"apc_list":null,"apc_paid":null,"fwci":0.6089,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.66737203,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"15","issue":"6","first_page":"1146","last_page":"1158"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9976000189781189,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9958000183105469,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6261261701583862},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.557516872882843},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4762282967567444},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.463986873626709},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44251179695129395},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4275425970554352},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.411212682723999},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3633086681365967},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34976956248283386},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3350973129272461},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3232015371322632}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6261261701583862},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.557516872882843},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4762282967567444},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.463986873626709},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44251179695129395},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4275425970554352},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.411212682723999},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3633086681365967},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34976956248283386},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3350973129272461},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3232015371322632},{"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.14778/3514061.3514063","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3514061.3514063","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1627627888","https://openalex.org/W1980162113","https://openalex.org/W1983383464","https://openalex.org/W2019040312","https://openalex.org/W2027770225","https://openalex.org/W2048392812","https://openalex.org/W2094224753","https://openalex.org/W2098664737","https://openalex.org/W2106759055","https://openalex.org/W2108077658","https://openalex.org/W2124738517","https://openalex.org/W2142599626","https://openalex.org/W2144543704","https://openalex.org/W2148178939","https://openalex.org/W2148606255","https://openalex.org/W2162808198","https://openalex.org/W2164053683","https://openalex.org/W2528743325","https://openalex.org/W2604379690","https://openalex.org/W2605272442","https://openalex.org/W2737681936","https://openalex.org/W2756352562","https://openalex.org/W3012585669","https://openalex.org/W3046691040","https://openalex.org/W3130246349","https://openalex.org/W3164681303"],"related_works":["https://openalex.org/W1994598067","https://openalex.org/W4367665025","https://openalex.org/W4377371889","https://openalex.org/W2113623403","https://openalex.org/W1862126075","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W1589381382","https://openalex.org/W961142965"],"abstract_inverted_index":{"Driven":[0],"by":[1,253,264],"applications":[2],"in":[3,78,94,149,180,234,258,269],"graph":[4,21],"analytics,":[5],"the":[6,37,57,62,70,82,91,112,123,140,213,230,250,281],"problem":[7,58],"of":[8,19,40,46,59,84,114,126,131,175,184,232,260,271,284],"efficiently":[9,60],"computing":[10,127,285],"all":[11,43,74,128,286],"k":[12,17,26,38,47,71,76,129,136,287,292],"-edge":[13],"connected":[14],"components":[15],"(":[16,102,119,158,221,298],"-ECCs)":[18],"a":[20,24,49,134,145,168,172,181,200,276,290],"G":[22,41,66,97,103,109,115,120,132,153,159,193,225],"for":[23,42,65,73,133,289],"user-given":[25],"has":[27],"been":[28],"extensively":[29],"and":[30,116,242,263],"well":[31],"studied.":[32],"It":[33],"is":[34,111,122,164,229],"known":[35],"that":[36,246],"-ECCs":[39,72,130,288],"possible":[44,75],"values":[45,77],"form":[48],"hierarchical":[50],"structure.":[51],"In":[52],"this":[53],"paper,":[54],"we":[55,143,207,278],"study":[56],"constructing":[61],"hierarchy":[63,92],"tree":[64,93],"which":[67,163],"compactly":[68],"encodes":[69],"space":[79,182,214,282],"linear":[80],"to":[81,167,211,216,255,266,293],"number":[83,231],"vertices":[85],"n.":[86],"All":[87],"existing":[88],"approaches":[89,252],"construct":[90],"O":[95,150,185,220,297],"(\u03b4(":[96],")":[98,104,105,110,121,160,161,190],"\u00d7":[99,155],"T":[100,117,156],"KECC":[101,118,157],"time,":[106,162,262],"where":[107,227],"\u03b4(":[108,152,192,224],"degeneracy":[113],"time":[124,141],"complexity":[125,183,215,283],"specific":[135,291],"value.":[137],"To":[138],"improve":[139,280],"complexity,":[142],"propose":[144,209],"divide-and-conquer":[146],"approach":[147,248],"running":[148,261],"((log":[151],"))":[154],"optimal":[165],"up":[166,254,265],"logarithmic":[169],"factor.":[170],"However,":[171],"straightforward":[173],"implementation":[174],"our":[176,247],"algorithm":[177],"would":[178],"result":[179],"((":[186],"m":[187,218,228,295],"+":[188,219,296],"n":[189,222,299],"log":[191,223],")).":[194],"As":[195,275],"main":[196,272],"memory":[197,273],"also":[198,279],"becomes":[199],"scarce":[201],"resource":[202],"when":[203],"processing":[204],"large-scale":[205],"graphs,":[206],"further":[208],"techniques":[210],"optimize":[212],"2":[217,294],")),":[226],"edges":[233],"G.":[235],"Extensive":[236],"experiments":[237],"on":[238],"large":[239],"real":[240],"graphs":[241,244],"synthetic":[243],"demonstrate":[245],"outperforms":[249],"state-of-the-art":[251],"28":[256],"times":[257,268],"terms":[259,270],"8":[267],"usage.":[274],"by-product,":[277],").":[300]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}