{"id":"https://openalex.org/W2108099581","doi":"https://doi.org/10.1109/ipdps.2008.4536237","title":"A new diffusion-based multilevel algorithm for computing graph partitions of very high quality","display_name":"A new diffusion-based multilevel algorithm for computing graph partitions of very high quality","publication_year":2008,"publication_date":"2008-04-01","ids":{"openalex":"https://openalex.org/W2108099581","doi":"https://doi.org/10.1109/ipdps.2008.4536237","mag":"2108099581"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2008.4536237","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2008.4536237","pdf_url":null,"source":{"id":"https://openalex.org/S4210174069","display_name":"Proceedings - IEEE International Parallel and Distributed Processing Symposium","issn_l":"1530-2075","issn":["1530-2075"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Parallel and Distributed Processing","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/A5020196859","display_name":"Henning Meyerhenke","orcid":"https://orcid.org/0000-0002-7769-726X"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Henning Meyerhenke","raw_affiliation_strings":["Department of Computer Science, University of Paderborn, Paderborn, Germany","Dept. of Comput. Sci., Univ. of Paderborn, Paderborn"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Paderborn, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Univ. of Paderborn, Paderborn","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086678348","display_name":"Burkhard Monien","orcid":"https://orcid.org/0000-0003-2334-6795"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Burkhard Monien","raw_affiliation_strings":["Department of Computer Science, University of Paderborn, Paderborn, Germany","Dept. of Comput. Sci., Univ. of Paderborn, Paderborn"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Paderborn, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Univ. of Paderborn, Paderborn","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017390373","display_name":"Thomas Sauerwald","orcid":"https://orcid.org/0000-0002-0882-283X"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas Sauerwald","raw_affiliation_strings":["Department of Computer Science, University of Paderborn, Paderborn, Germany","Dept. of Comput. Sci., Univ. of Paderborn, Paderborn"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Paderborn, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Univ. of Paderborn, Paderborn","institution_ids":["https://openalex.org/I206945453"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5020196859"],"corresponding_institution_ids":["https://openalex.org/I206945453"],"apc_list":null,"apc_paid":null,"fwci":5.7638,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.96123201,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"13"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":1.0,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.998199999332428,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9973000288009644,"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/graph-partition","display_name":"Graph partition","score":0.7354869246482849},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6637483239173889},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5792151689529419},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5783483982086182},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.504198431968689},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.504109263420105},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.41850659251213074},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3602742850780487},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.32890379428863525},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.210433691740036},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09417396783828735},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08288121223449707}],"concepts":[{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.7354869246482849},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6637483239173889},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5792151689529419},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5783483982086182},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.504198431968689},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.504109263420105},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.41850659251213074},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3602742850780487},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.32890379428863525},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.210433691740036},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09417396783828735},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08288121223449707}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ipdps.2008.4536237","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2008.4536237","pdf_url":null,"source":{"id":"https://openalex.org/S4210174069","display_name":"Proceedings - IEEE International Parallel and Distributed Processing Symposium","issn_l":"1530-2075","issn":["1530-2075"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Parallel and Distributed Processing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.470.5505","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.470.5505","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://parco.iti.uni-karlsruhe.de/henningm/data/JPDC09.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":47,"referenced_works":["https://openalex.org/W73496309","https://openalex.org/W1485041102","https://openalex.org/W1490530634","https://openalex.org/W1532006000","https://openalex.org/W1549438956","https://openalex.org/W1560598623","https://openalex.org/W1596502281","https://openalex.org/W1683782298","https://openalex.org/W1961194538","https://openalex.org/W1966461475","https://openalex.org/W1970652797","https://openalex.org/W1986076296","https://openalex.org/W1989826169","https://openalex.org/W2004951603","https://openalex.org/W2006127455","https://openalex.org/W2020140168","https://openalex.org/W2054653187","https://openalex.org/W2055418477","https://openalex.org/W2067976091","https://openalex.org/W2071257090","https://openalex.org/W2077240465","https://openalex.org/W2082472316","https://openalex.org/W2095117703","https://openalex.org/W2104344346","https://openalex.org/W2118953734","https://openalex.org/W2121075095","https://openalex.org/W2121947440","https://openalex.org/W2122244071","https://openalex.org/W2127927798","https://openalex.org/W2129271455","https://openalex.org/W2132745343","https://openalex.org/W2145701440","https://openalex.org/W2150593711","https://openalex.org/W2161455936","https://openalex.org/W2166417226","https://openalex.org/W2403201314","https://openalex.org/W2405738579","https://openalex.org/W2490989163","https://openalex.org/W3140103141","https://openalex.org/W3142035222","https://openalex.org/W4236269389","https://openalex.org/W4285719527","https://openalex.org/W6629004930","https://openalex.org/W6629246942","https://openalex.org/W6631861331","https://openalex.org/W6635735666","https://openalex.org/W6637411497"],"related_works":["https://openalex.org/W3161249280","https://openalex.org/W2267059662","https://openalex.org/W2364268683","https://openalex.org/W4388411807","https://openalex.org/W1519906715","https://openalex.org/W2478803962","https://openalex.org/W3139829055","https://openalex.org/W2583811263","https://openalex.org/W3211941742","https://openalex.org/W2035944803"],"abstract_inverted_index":{"Graph":[0,42],"partitioning":[1,43,68,256],"requires":[2,140],"the":[3,30,38,74,97,101,104,109,112,121,162,204,223,269,273,295,298,304,307,312,326],"division":[4],"of":[5,32,55,73,96,103,111,176,206,222,231,272,300,335,337],"a":[6,53,71,79,133,166,194,199,212,228,241,264,332],"graph's":[7],"vertex":[8],"set":[9],"into":[10],"k":[11],"equally":[12],"sized":[13],"subsets":[14],"such":[15],"that":[16,52,190],"some":[17],"objective":[18,106],"function":[19,107],"is":[20,40,44,124,144,171,209,217],"optimized.":[21],"For":[22],"many":[23,49],"important":[24,46],"ob":[25],"jective":[26],"functions,":[27],"e.":[28],"g.,":[29],"number":[31,299,334],"edges":[33],"incident":[34],"to":[35,117,127,174,219,260],"different":[36,213,247],"partitions,":[37],"problem":[39],"MV-hard.":[41],"an":[45,150,282],"task":[47],"in":[48,136,240,303],"applications,":[50],"so":[51],"variety":[54],"algorithms":[56],"and":[57,108,225,297,306,316],"tools":[58],"for":[59,203,331],"its":[60,118,130,181],"solution":[61,183],"have":[62,147,324],"been":[63],"developed.":[64],"Most":[65],"state-of-the-art":[66,313],"graph":[67,224,255],"libraries":[69,84,314],"use":[70,131],"variant":[72],"Kernighan-Lin":[75],"(KL)":[76],"heuristic":[77,123,257],"within":[78],"multilevel":[80,242],"framework.":[81],"While":[82],"these":[83],"are":[85],"very":[86],"fast,":[87],"their":[88],"solutions":[89],"do":[90],"not":[91,125],"always":[92],"meet":[93],"all":[94],"requirements":[95],"users.":[98],"This":[99],"includes":[100],"choice":[102],"appropriate":[105],"shape":[110],"computed":[113],"partitions.":[114],"Moreover,":[115],"due":[116],"sequential":[119],"nature,":[120],"KL":[122],"easy":[126],"parallelize.":[128],"Thus,":[129],"as":[132],"load":[134],"balancer":[135],"parallel":[137,152],"numerical":[138],"applications":[139],"complicated":[141],"adaptations.":[142],"That":[143],"why":[145],"we":[146,197,251,323],"developed":[148],"previously":[149],"inherently":[151],"algorithm,":[153,322],"called":[154],"BUBBLE-FOS/C":[155,191,239],"(Meyerhenke":[156],"et":[157],"ah,":[158],"IPDPS'06),":[159],"which":[160,216],"optimizes":[161],"partition":[163],"shapes":[164],"by":[165,294],"diffusive":[167,214],"mechanism.":[168],"Yet,":[169],"it":[170,262],"too":[172],"slow":[173],"be":[175],"real":[177],"practical":[178],"use,":[179],"despite":[180],"high":[182,229],"quality.":[184],"In":[185],"this":[186,235],"paper,":[187],"besides":[188],"proving":[189],"converges":[192],"towards":[193],"local":[195,220],"optimum,":[196],"develop":[198],"much":[200],"faster":[201],"method":[202],"improvement":[205],"partitionings.":[207],"It":[208],"based":[210,244],"on":[211,245],"process,":[215],"restricted":[218],"areas":[221],"also":[226],"contains":[227],"degree":[230],"parallelism.":[232],"By":[233],"coupling":[234],"new":[236,254,321],"technique":[237],"with":[238,277,319],"framework":[243],"two":[246],"hierarchy":[248],"construction":[249],"methods,":[250],"obtain":[252],"our":[253,320],"DibaP.":[258],"Compared":[259],"BUBBLE-FOS/C,":[261],"shows":[263],"considerable":[265],"acceleration,":[266],"while":[267],"retaining":[268],"positive":[270],"properties":[271],"slower":[274],"algorithm.":[275],"Experiments":[276],"popular":[278],"benchmark":[279,341],"graphs":[280],"show":[281],"extremely":[283],"good":[284],"behavior.":[285],"First,":[286],"DibaP":[287],"computes":[288],"consistently":[289],"better":[290],"results":[291],"-":[292,310],"measured":[293],"edge-cut":[296,329],"boundary":[301],"vertices":[302],"summation":[305],"maximum":[308],"norm":[309],"than":[311],"METIS":[315],"JOSTLE.":[317],"Second,":[318],"improved":[325],"best":[327],"known":[328],"values":[330],"significant":[333],"partitionings":[336],"six":[338],"widely":[339],"used":[340],"graphs.":[342]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}