{"id":"https://openalex.org/W4381542548","doi":"https://doi.org/10.1007/s00778-023-00797-x","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":2023,"publication_date":"2023-05-06","ids":{"openalex":"https://openalex.org/W4381542548","doi":"https://doi.org/10.1007/s00778-023-00797-x"},"language":"en","primary_location":{"id":"doi:10.1007/s00778-023-00797-x","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s00778-023-00797-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00778-023-00797-x.pdf","source":{"id":"https://openalex.org/S78926909","display_name":"The VLDB Journal","issn_l":"0949-877X","issn":["0949-877X","1066-8888"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The VLDB Journal","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00778-023-00797-x.pdf","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":["School of Computer Science, The University of Sydney, Sydney, NSW, Australia","School of Computer Science, The University of Sydney, Sydney, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, The University of Sydney, Sydney, NSW, Australia","institution_ids":["https://openalex.org/I129604602"]},{"raw_affiliation_string":"School of Computer Science, The University of Sydney, Sydney, Australia","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":["School of Computer Science, The University of Sydney, Sydney, NSW, Australia","School of Computer Science, The University of Sydney, Sydney, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, The University of Sydney, Sydney, NSW, Australia","institution_ids":["https://openalex.org/I129604602"]},{"raw_affiliation_string":"School of Computer Science, The University of Sydney, Sydney, Australia","institution_ids":["https://openalex.org/I129604602"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5037530341"],"corresponding_institution_ids":["https://openalex.org/I129604602"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":0.1348,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.49462774,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":94},"biblio":{"volume":"33","issue":"1","first_page":"49","last_page":"71"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","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"}},{"id":"https://openalex.org/T10083","display_name":"Graphene research and applications","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials 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.9929999709129333,"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/algorithm","display_name":"Algorithm","score":0.6082395911216736},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4495585262775421},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4173113703727722},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.40411537885665894},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.08175253868103027}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6082395911216736},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4495585262775421},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4173113703727722},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.40411537885665894},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.08175253868103027}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00778-023-00797-x","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s00778-023-00797-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00778-023-00797-x.pdf","source":{"id":"https://openalex.org/S78926909","display_name":"The VLDB Journal","issn_l":"0949-877X","issn":["0949-877X","1066-8888"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The VLDB Journal","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00778-023-00797-x","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s00778-023-00797-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00778-023-00797-x.pdf","source":{"id":"https://openalex.org/S78926909","display_name":"The VLDB Journal","issn_l":"0949-877X","issn":["0949-877X","1066-8888"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The VLDB Journal","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3323630674","display_name":"Directionality-Aware Cohesive Subgraph Search over Directed Graphs","funder_award_id":"DP220103731","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"},{"id":"https://openalex.org/G4022747918","display_name":"Advanced search of cohesive subgraphs in big graphs","funder_award_id":"FT180100256","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"}],"funders":[{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4381542548.pdf","grobid_xml":"https://content.openalex.org/works/W4381542548.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W1535144194","https://openalex.org/W1980162113","https://openalex.org/W1983383464","https://openalex.org/W1998644443","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/W2115049345","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/W2278710066","https://openalex.org/W2538025144","https://openalex.org/W2586392344","https://openalex.org/W2604379690","https://openalex.org/W2605272442","https://openalex.org/W2737681936","https://openalex.org/W2962788915","https://openalex.org/W3012585669","https://openalex.org/W3046691040","https://openalex.org/W3130246349","https://openalex.org/W3164681303","https://openalex.org/W4224218423","https://openalex.org/W4233225156","https://openalex.org/W4251396722","https://openalex.org/W4283326737","https://openalex.org/W4285802475"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2350741829","https://openalex.org/W2530322880"],"abstract_inverted_index":{"Abstract":[0],"The":[1,35,110],"problem":[2,89],"of":[3,15,29,39,90,96,137,170,185,191,201,214,217,230,289,331,340],"efficiently":[4,91],"computing":[5,186],"all":[6,42,102,187,215],"$$k$$":[7,12,36,55,67,98,188],"k":[8,13,37,56,61,68,78,99,104,189,196],"-edge-connected":[9],"components":[10],"(":[11,77,147,149,155,164,178,250,259,260,263,270,303,304,311],"-ECCs)":[14],"a":[16,20,47,73,107,124,128,194,241,282,286],"graph":[17,108],"G":[18,40,150,156,165,171,179,192,202,218,264,271,312],"for":[19,41,58,101,106,193],"user-givenk":[21],"has":[22],"been":[23],"extensively":[24],"studied":[25],"recently":[26],"in":[27,32,72,122,232,247,333],"view":[28],"its":[30],"importance":[31],"many":[33],"applications.":[34],"-ECCs":[38,57,100,190],"possible":[43,103],"values":[44],"ofk":[45],"form":[46],"hierarchical":[48],"structure;":[49],"that":[50],"is,":[51],"any":[52,66],"two":[53],"different":[54],"the":[59,88,93,97,119,134,168,182,199,206,210,228,236,329,337,350],"same":[60],"value":[62,208],"are":[63],"disjoint":[64],"and":[65,115,172,219],"-ECC":[69],"is":[70,167,181,203,220,227,278,328],"contained":[71],"unique":[74],"$$(k\\text":[75],"{-}1)$$":[76],"-":[79],"1":[80],")":[81,151,157,158,166,180,265,266,272,273,308,313,314],"-ECC.":[82],"In":[83],"this":[84,275],"paper,":[85],"we":[86,239,343],"study":[87],"constructing":[92],"hierarchy":[94,120],"tree":[95,121],"values,":[105],"G.":[109,233,334],"existing":[111],"approaches":[112],"$$\\textsf{TD}$$":[113],"TD":[114],"$$\\textsf{BU}$$":[116],"BU":[117],"construct":[118],"either":[123],"top-down":[125],"manner":[126],"or":[127],"bottom-up":[129],"manner,":[130],"with":[131],"both":[132],"having":[133],"time":[135,183,237,276],"complexity":[136,184,277,352],"$${{\\mathcal":[138,248,294],"{O}}}\\big":[139,249],"(\\delta":[140],"(G)\\times":[141],"{\\mathsf":[142,254],"{T_{KECC}}}":[143,174,255],"(G)\\big":[144,256],")$$":[145,257],"O":[146,258,302],"\u03b4":[148,163,262,310],"\u00d7":[152,267],"T":[153,176,268],"KECC":[154,177,269],",":[159],"where":[160,225],"$$\\delta":[161],"(G)$$":[162,175],"degeneracy":[169,200],"$${\\mathsf":[173],"specific":[195],"value.":[197],"Here,":[198],"defined":[204],"as":[205],"maximum":[207],"among":[209],"minimum":[211],"vertex":[212],"degrees":[213],"subgraphs":[216],"at":[221],"most":[222],"$$\\sqrt{m}$$":[223],"m":[224,226,305],"number":[229,330],"edges":[231],"To":[234,335],"improve":[235],"complexity,":[238],"propose":[240,344],"divide-and-conquer":[242],"approach":[243],"$$\\textsf{DC}$$":[244,290],"DC":[245,291],"running":[246],"(\\log":[251],"\\delta":[252,300,356],"(G))\\times":[253],"log":[261,309],"time;":[274],"optimal":[279],"up":[280],"to":[281,348,353],"logarithmic":[283],"factor.":[284],"However,":[285],"straightforward":[287],"implementation":[288],"would":[292],"take":[293],"{O}}}(":[295],"(m":[296],"+":[297,306],"n)":[298],"\\log":[299],"(G))$$":[301,357],"n":[307,327],"main-memory":[315,338],"space,":[316],"which":[317],"could":[318],"easily":[319],"run":[320],"out-of-memory":[321],"when":[322],"processing":[323],"large":[324],"graphs;":[325],"here,":[326],"vertices":[332],"reduce":[336],"footprint":[339],"our":[341],"algorithm,":[342],"adjacency":[345],"array-based":[346],"techniques":[347],"optimize":[349],"space":[351],"$$2m+{{\\mathcal":[354],"{O}}}(n\\log":[355]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-08-28T12:50:07.497085","created_date":"2025-10-10T00:00:00"}