{"id":"https://openalex.org/W2111706995","doi":"https://doi.org/10.1109/ipdps.2004.1303286","title":"Towards a parallel disk-based algorithm for multilevel k-way hypergraph partitioning","display_name":"Towards a parallel disk-based algorithm for multilevel k-way hypergraph partitioning","publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W2111706995","doi":"https://doi.org/10.1109/ipdps.2004.1303286","mag":"2111706995"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2004.1303286","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2004.1303286","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.","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/A5086589607","display_name":"Aleksandar Trifunovi\u0107","orcid":"https://orcid.org/0000-0003-0278-0488"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"A. Trifunovic","raw_affiliation_strings":["Department of Computing Imperial College London, South Kensington Campus, London, UK","Dept. of Comput., Imperial Coll., London, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computing Imperial College London, South Kensington Campus, London, UK","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"Dept. of Comput., Imperial Coll., London, UK","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043998902","display_name":"W.J. Knottenbelt","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"W.J. Knottenbelt","raw_affiliation_strings":["Department of Computing Imperial College London, South Kensington Campus, London, UK","Dept. of Comput., Imperial Coll., London, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computing Imperial College London, South Kensington Campus, London, UK","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"Dept. of Comput., Imperial Coll., London, UK","institution_ids":["https://openalex.org/I47508984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086589607"],"corresponding_institution_ids":["https://openalex.org/I47508984"],"apc_list":null,"apc_paid":null,"fwci":1.3551,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.81824093,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"2","issue":null,"first_page":"236","last_page":"243"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9994000196456909,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9970999956130981,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.8274959325790405},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7023909091949463},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6771932244300842},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.663415789604187},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5983515977859497},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5738423466682434},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.5377218127250671},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4484281539916992},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4452904164791107},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.307079553604126},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20897281169891357},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.16726899147033691},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.15455946326255798}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8274959325790405},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7023909091949463},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6771932244300842},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.663415789604187},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5983515977859497},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5738423466682434},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.5377218127250671},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4484281539916992},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4452904164791107},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.307079553604126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20897281169891357},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.16726899147033691},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15455946326255798},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ipdps.2004.1303286","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2004.1303286","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.422.3163","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.422.3163","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.doc.ic.ac.uk/~wjk/publications/trifunovic-knottenbelt-ijcse-06.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":32,"referenced_works":["https://openalex.org/W1484151559","https://openalex.org/W1510543252","https://openalex.org/W1973113780","https://openalex.org/W1981893977","https://openalex.org/W1984283136","https://openalex.org/W2007480409","https://openalex.org/W2010346244","https://openalex.org/W2011039300","https://openalex.org/W2025754355","https://openalex.org/W2027463479","https://openalex.org/W2032145219","https://openalex.org/W2070232376","https://openalex.org/W2083637347","https://openalex.org/W2095117703","https://openalex.org/W2107721006","https://openalex.org/W2109220922","https://openalex.org/W2136211791","https://openalex.org/W2136380704","https://openalex.org/W2142184646","https://openalex.org/W2143131337","https://openalex.org/W2150089213","https://openalex.org/W2169060214","https://openalex.org/W2244550955","https://openalex.org/W3140226502","https://openalex.org/W3202477519","https://openalex.org/W4236269389","https://openalex.org/W4246367117","https://openalex.org/W4252350656","https://openalex.org/W6629020949","https://openalex.org/W6678321130","https://openalex.org/W6684948532","https://openalex.org/W6825713691"],"related_works":["https://openalex.org/W4376608589","https://openalex.org/W1537073411","https://openalex.org/W1948107826","https://openalex.org/W3138003926","https://openalex.org/W2777980911","https://openalex.org/W2552825874","https://openalex.org/W3139829055","https://openalex.org/W2583811263","https://openalex.org/W3211941742","https://openalex.org/W2035944803"],"abstract_inverted_index":{"Summary":[0],"form":[1],"only":[2],"given.":[3],"Here":[4],"we":[5],"present":[6],"a":[7,42,119],"disk-based":[8],"parallel":[9,51,60,64,121],"formulation":[10],"of":[11,55,93,108],"the":[12,21,35,56,78,91,99,109],"multilevel":[13],"k-way":[14],"hypergraph":[15,58],"partitioning":[16,54,100,123],"algorithm.":[17],"This":[18],"algorithm":[19,46,79],"provides":[20],"capability":[22],"to":[23,72,80],"partition":[24],"very":[25,81],"large":[26,82],"hypergraphs":[27,83],"that":[28,39,98],"hitherto":[29],"could":[30],"not":[31],"be":[32],"partitioned":[33],"since":[34],"memory":[36,74],"required":[37],"exceeds":[38],"available":[40],"on":[41],"single":[43],"workstation.":[44],"The":[45],"has":[47],"three":[48],"main":[49],"phases:":[50],"coarsening,":[52],"sequential":[53],"coarsest":[57],"and":[59,66,96],"refinement.":[61],"At":[62],"each":[63],"coarsening":[65],"refinement":[67],"step":[68],"disk":[69],"is":[70,102],"used":[71],"minimise":[73],"usage.":[75],"We":[76],"apply":[77],"with":[84],"/spl":[85],"Theta/(10/sup":[86],"7":[87],"/)":[88],"vertices":[89],"from":[90],"domain":[92],"performance":[94],"modelling":[95],"show":[97],"quality":[101],"approximately":[103],"20%":[104],"better":[105],"in":[106],"terms":[107],"(k":[110],"-":[111],"1)":[112],"metric":[113],"than":[114],"approximate":[115],"partitionings":[116],"produced":[117],"by":[118],"state-of-the-art":[120],"graph":[122],"tool.":[124]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}