{"id":"https://openalex.org/W2298648390","doi":"https://doi.org/10.1145/2851496","title":"Tree-Based Coarsening and Partitioning of Complex Networks","display_name":"Tree-Based Coarsening and Partitioning of Complex Networks","publication_year":2016,"publication_date":"2016-01-29","ids":{"openalex":"https://openalex.org/W2298648390","doi":"https://doi.org/10.1145/2851496","mag":"2298648390"},"language":"en","primary_location":{"id":"doi:10.1145/2851496","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2851496","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"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":"ACM Journal of Experimental Algorithmics","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/A5081623810","display_name":"Roland Glantz","orcid":null},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Roland Glantz","raw_affiliation_strings":["Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020196859","display_name":"Henning Meyerhenke","orcid":"https://orcid.org/0000-0002-7769-726X"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Henning Meyerhenke","raw_affiliation_strings":["Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059665527","display_name":"Christian Schulz","orcid":"https://orcid.org/0000-0002-2823-3506"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Schulz","raw_affiliation_strings":["Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5081623810"],"corresponding_institution_ids":["https://openalex.org/I102335020"],"apc_list":null,"apc_paid":null,"fwci":0.8839,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.74362993,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"21","issue":null,"first_page":"1","last_page":"20"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9890000224113464,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9872999787330627,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6195378303527832},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5929621458053589},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5567305088043213},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5495645999908447},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5447235703468323},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.523352324962616},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.508274257183075},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5061785578727722},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.46568670868873596},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.462637335062027},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43994027376174927},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4352879524230957},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4331216812133789},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41190189123153687},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3610366880893707},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3322158455848694},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.331398606300354},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12413948774337769},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09799447655677795}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6195378303527832},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5929621458053589},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5567305088043213},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5495645999908447},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5447235703468323},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.523352324962616},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.508274257183075},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5061785578727722},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.46568670868873596},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.462637335062027},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43994027376174927},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4352879524230957},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4331216812133789},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41190189123153687},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3610366880893707},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3322158455848694},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.331398606300354},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12413948774337769},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09799447655677795},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2851496","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2851496","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"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":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.763.9245","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.763.9245","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1402.2782.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W27955378","https://openalex.org/W96060697","https://openalex.org/W125936143","https://openalex.org/W1490949485","https://openalex.org/W1546413495","https://openalex.org/W1556784394","https://openalex.org/W1568368458","https://openalex.org/W1574275613","https://openalex.org/W1585044132","https://openalex.org/W1875112053","https://openalex.org/W1910515323","https://openalex.org/W1989826169","https://openalex.org/W1999170091","https://openalex.org/W1999478155","https://openalex.org/W2002055996","https://openalex.org/W2019040312","https://openalex.org/W2032950184","https://openalex.org/W2034331023","https://openalex.org/W2038164234","https://openalex.org/W2065309575","https://openalex.org/W2070232376","https://openalex.org/W2106092551","https://openalex.org/W2116450608","https://openalex.org/W2118382442","https://openalex.org/W2118953734","https://openalex.org/W2121743855","https://openalex.org/W2129271455","https://openalex.org/W2129934604","https://openalex.org/W2132202037","https://openalex.org/W2137120608","https://openalex.org/W2138508044","https://openalex.org/W2149098716","https://openalex.org/W2153507546","https://openalex.org/W2172051569","https://openalex.org/W2265341574","https://openalex.org/W2397799191","https://openalex.org/W2534652523","https://openalex.org/W2697704498","https://openalex.org/W2952822878","https://openalex.org/W2963798707","https://openalex.org/W3039948875","https://openalex.org/W4238452917","https://openalex.org/W4242903830","https://openalex.org/W4285719527","https://openalex.org/W6678077968"],"related_works":["https://openalex.org/W1997194225","https://openalex.org/W1521806911","https://openalex.org/W2684541573","https://openalex.org/W2587427341","https://openalex.org/W3022017449","https://openalex.org/W185808615","https://openalex.org/W2053467581","https://openalex.org/W2761026540","https://openalex.org/W2911954484","https://openalex.org/W4295120800"],"abstract_inverted_index":{"A":[0],"hierarchy":[1,29,53],"of":[2,6,59,101,109,146,182,191,209,213,247,311],"increasingly":[3],"coarse":[4],"versions":[5],"a":[7,28,31,52,66,91,135,147,161,214,225,236,248,299],"network":[8,14,32,148,175,313],"allows":[9],"one":[10],"to":[11,62,168,204,283],"represent":[12],"the":[13,19,23,45,48,57,60,69,79,83,87,98,102,106,144,151,174,179,183,189,199,206,220,232,242,262,284,309],"on":[15,30,178],"multiple":[16],"scales":[17],"at":[18],"same":[20],"time.":[21],"Often,":[22],"elementary":[24],"operation":[25,38],"for":[26,119,123,143,154,240,274,293],"generating":[27],"is":[33,54],"merging":[34],"adjacent":[35],"vertices,":[36],"an":[37],"that":[39,86,149,261],"can":[40],"be":[41,63],"realized":[42],"through":[43],"contracting":[44],"edge":[46,137,194,222,270],"between":[47,65],"two":[49],"vertices.":[50],"Such":[51],"defined":[55],"by":[56,139,266,280,315],"selection":[58,74,84],"edges":[61,89,104,145,176],"contracted":[64],"level":[67],"and":[68,171,230],"next":[70],"coarser":[71],"level.":[72],"The":[73],"may":[75],"involve":[76],"(i)":[77,140],"rating":[78,138,173,195,223,287],"edges,":[80],"(ii)":[81,159],"constraining":[82],"(e.g.,":[85],"selected":[88,103],"form":[90],"matching),":[92],"as":[93,95],"well":[94],"(iii)":[96,172],"maximizing":[97],"total":[99],"rate":[100],"under":[105],"constraints.":[107],"Hierarchies":[108],"this":[110,131],"kind":[111],"are,":[112],"among":[113],"others,":[114],"involved":[115],"in":[116,125,252,291,302],"multilevel":[117,227],"methods":[118],"partitioning":[120],"networks\u2014a":[121],"prerequisite":[122],"processing":[124],"parallel":[126],"with":[127,166,235,288,298],"distributed":[128],"memory.":[129],"In":[130,296],"article,":[132],"we":[133,197,254],"propose":[134],"new":[136,193,221,237,269,306],"defining":[141],"weights":[142],"express":[150],"edges\u2019":[152],"importance":[153],"connectivity":[155],"via":[156],"shortest":[157],"paths,":[158],"computing":[160],"minimum":[162],"weight":[163],"spanning":[164,216],"tree":[165],"respect":[167],"these":[169],"weights,":[170],"based":[177],"conductance":[180,207],"values":[181,208],"tree\u2019s":[184],"fundamental":[185,211],"cuts.":[186],"To":[187],"make":[188],"computation":[190],"our":[192,305],"efficient,":[196],"develop":[198],"first":[200],"optimal":[201],"linear-time":[202],"algorithm":[203],"compute":[205],"all":[210],"cuts":[212],"given":[215],"tree.":[217],"We":[218],"integrate":[219],"into":[224],"leading":[226],"graph":[228],"partitioner":[229],"equip":[231],"latter":[233],"also":[234],"greedy":[238],"postprocessing":[239,263,290],"optimizing":[241],"Maximum":[243],"Communication":[244],"Volume":[245],"(MCV)":[246],"partition.":[249],"Our":[250,268],"experiments,":[251],"which":[253],"bipartition":[255],"frequently":[256],"used":[257,273],"benchmark":[258],"networks,":[259],"show":[260],"reduces":[264,278,308],"MCV":[265,279,289,310],"11.3%.":[267],"rating,":[271],"here":[272],"matching-based":[275],"coarsening,":[276],"further":[277],"10.3%":[281],"compared":[282],"previously":[285],"best":[286],"place":[292],"both":[294],"ratings.":[295],"total,":[297],"modest":[300],"increase":[301],"running":[303],"time,":[304],"approach":[307],"complex":[312],"partitions":[314],"20.4%.":[316]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}