{"id":"https://openalex.org/W2921849321","doi":null,"title":"Optimal hypergraph partitioning","display_name":"Optimal hypergraph partitioning","alternate_titles":[],"publication_year":2018,"publication_date":"2018-07-31","ids":{"openalex":"https://openalex.org/W2921849321","mag":"2921849321"},"language":"en","primary_location":{"id":"pmh:oai:research.sabanciuniv.edu:36612","doi":null,"is_oa":true,"landing_page_url":"https://research.sabanciuniv.edu/id/eprint/36612/1/10207524_BaranUsta.pdf","pdf_url":"http://research.sabanciuniv.edu/36612/1/10207524_BaranUsta.pdf","source":{"id":"https://openalex.org/S4306402254","display_name":"Sabanci University","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I134235054","host_organization_name":"Sabanc\u0131 \u00dcniversitesi","host_organization_lineage":["https://openalex.org/I134235054"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Thesis"},"parent_works":[],"lineage":["https://openalex.org/W2921849321"],"child_works_count":0,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://research.sabanciuniv.edu/36612/1/10207524_BaranUsta.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021764988","display_name":"Baran Usta","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I134235054","display_name":"Sabanc\u0131 \u00dcniversitesi","ror":"https://ror.org/049asqa32","country_code":"TR","type":"education","lineage":["https://openalex.org/I134235054"]}],"countries":["TR"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Baran Usta","raw_affiliation_strings":["Graduate School of Sabanc\u0131 University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Sabanc\u0131 University","institution_ids":["https://openalex.org/I134235054"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5021764988"],"corresponding_institution_ids":["https://openalex.org/I134235054"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.6000999808311462,"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":0.6000999808311462,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.13770000636577606,"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.0640999972820282,"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/hypergraph-partitioning","display_name":"hypergraph partitioning","score":0.996999979019165},{"id":"https://openalex.org/keywords/optimal-partitioning","display_name":"optimal partitioning","score":0.9169999957084656},{"id":"https://openalex.org/keywords/pharaoh","display_name":"Pharaoh","score":0.8920000195503235},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.8420000076293945},{"id":"https://openalex.org/keywords/master-slave-parallelization","display_name":"master-slave parallelization","score":0.9869999885559082},{"id":"https://openalex.org/keywords/vlsi-design","display_name":"VLSI design","score":0.8019999861717224},{"id":"https://openalex.org/keywords/distributed-algorithms","display_name":"distributed algorithms","score":0.8989999890327454},{"id":"https://openalex.org/keywords/np-hard-combinatorial-optimization","display_name":"NP-hard combinatorial optimization","score":0.781000018119812}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.9501971006393433},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8524879813194275},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.8120201230049133},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6679961085319519},{"id":"https://openalex.org/C14580979","wikidata":"https://www.wikidata.org/wiki/Q876049","display_name":"Very-large-scale integration","level":2,"score":0.5139579176902771},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43596649169921875},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3877435326576233},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3650396764278412},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33212190866470337},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2298748791217804},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.14754784107208252},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12467435002326965},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:research.sabanciuniv.edu:36612","doi":null,"is_oa":true,"landing_page_url":"https://research.sabanciuniv.edu/id/eprint/36612/1/10207524_BaranUsta.pdf","pdf_url":"http://research.sabanciuniv.edu/36612/1/10207524_BaranUsta.pdf","source":{"id":"https://openalex.org/S4306402254","display_name":"Sabanci University","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I134235054","host_organization_name":"Sabanc\u0131 \u00dcniversitesi","host_organization_lineage":["https://openalex.org/I134235054"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Thesis"},{"id":"mag:2921849321","doi":null,"is_oa":false,"landing_page_url":"https://research.sabanciuniv.edu/36612/","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:research.sabanciuniv.edu:36612","doi":null,"is_oa":true,"landing_page_url":"https://research.sabanciuniv.edu/id/eprint/36612/1/10207524_BaranUsta.pdf","pdf_url":"http://research.sabanciuniv.edu/36612/1/10207524_BaranUsta.pdf","source":{"id":"https://openalex.org/S4306402254","display_name":"Sabanci University","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I134235054","host_organization_name":"Sabanc\u0131 \u00dcniversitesi","host_organization_lineage":["https://openalex.org/I134235054"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Thesis"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2921849321.pdf","grobid_xml":"https://content.openalex.org/works/W2921849321.grobid-xml"},"referenced_works_count":59,"referenced_works":["https://openalex.org/W42677130","https://openalex.org/W52840101","https://openalex.org/W63386442","https://openalex.org/W94792778","https://openalex.org/W96060697","https://openalex.org/W277847116","https://openalex.org/W1150057154","https://openalex.org/W1490530634","https://openalex.org/W1493144710","https://openalex.org/W1498148168","https://openalex.org/W1504421518","https://openalex.org/W1546862091","https://openalex.org/W1554631849","https://openalex.org/W1563121416","https://openalex.org/W1584753249","https://openalex.org/W1789125946","https://openalex.org/W1939990554","https://openalex.org/W1979388401","https://openalex.org/W1984283136","https://openalex.org/W1995274002","https://openalex.org/W2006772093","https://openalex.org/W2014111643","https://openalex.org/W2034662705","https://openalex.org/W2057392949","https://openalex.org/W2059946383","https://openalex.org/W2066270046","https://openalex.org/W2066749637","https://openalex.org/W2073890622","https://openalex.org/W2074032650","https://openalex.org/W2078174680","https://openalex.org/W2078358924","https://openalex.org/W2096159022","https://openalex.org/W2100636584","https://openalex.org/W2108219155","https://openalex.org/W2114030927","https://openalex.org/W2115762048","https://openalex.org/W2118953734","https://openalex.org/W2121253712","https://openalex.org/W2130970357","https://openalex.org/W2131509030","https://openalex.org/W2142184646","https://openalex.org/W2142644532","https://openalex.org/W2158598102","https://openalex.org/W2161455936","https://openalex.org/W2163501979","https://openalex.org/W2166001313","https://openalex.org/W2166811255","https://openalex.org/W2168493201","https://openalex.org/W2170057991","https://openalex.org/W2171227249","https://openalex.org/W2171242245","https://openalex.org/W2172669402","https://openalex.org/W2399100674","https://openalex.org/W2401610261","https://openalex.org/W2402483587","https://openalex.org/W2604396201","https://openalex.org/W2752305262","https://openalex.org/W2899035857","https://openalex.org/W4236269389"],"related_works":["https://openalex.org/W4387461247","https://openalex.org/W7042697830","https://openalex.org/W6950500850","https://openalex.org/W6931820734","https://openalex.org/W2963489471","https://openalex.org/W2469062873","https://openalex.org/W7083729856","https://openalex.org/W3154405834","https://openalex.org/W4226435553","https://openalex.org/W4288951584"],"abstract_inverted_index":{"Hypergraph":[0],"partitioning":[1,64],"into":[2],"K":[3],"parts":[4],"has":[5,189],"many":[6,83],"applications":[7],"in":[8,27,86,94,206],"practice":[9,95],"such":[10],"as":[11],"distributed":[12],"algorithms":[13],"and":[14,44,184,209],"very":[15,36],"large":[16],"scale":[17],"integrated":[18],"circuit":[19],"(VLSI)":[20],"design.":[21],"There":[22,59],"are":[23],"various":[24],"tools":[25,52,159],"proposed":[26],"the":[28,40,45,87,102,106,129,135,138,152,155,167,173,176,193,196,201,204,207,228,231],"literature":[29],"which":[30,220],"can":[31,78,111,160,221],"partition":[32],"a":[33,73,90],"given":[34,130],"hypergraph":[35,75,232],"fast.":[37],"However,":[38],"since":[39,96],"problem":[41],"is":[42,60,92,125],"NP-Hard":[43],"traditional":[46],"approaches":[47],"heavily":[48],"use":[49],"heuristics,":[50],"these":[51],"do":[53],"not":[54,126],"provide":[55,79],"an":[56,115,122],"optimal":[57,80,123],"partition.":[58,117,141],"limited":[61],"research":[62],"on":[63,144,200,227],"hypergraphs":[65,145],"optimally.":[66],"In":[67,169,212],"this":[68,213],"thesis,":[69],"we":[70,179,215],"propose":[71,216],"PHaraoh,":[72],"parallel":[74],"partitioner":[76,91],"that":[77,151,192],"partitions":[81,156],"for":[82,164],"metrics":[84],"used":[85],"literature.":[88],"Such":[89],"important":[93],"it":[97],"enables":[98],"us":[99],"to":[100,119,171],"evaluate":[101],"true":[103],"performance":[104],"of":[105,137,154,157,166,195,203,230],"existing":[107,158],"tools.":[108],"Furthermore,":[109],"PHaraoh":[110,133],"be":[112,161],"started":[113],"with":[114,181],"initial":[116,140],"Thanks":[118],"that,":[120],"even":[121],"solution":[124],"found":[127],"within":[128],"time":[131],"limit,":[132],"improves":[134],"cost":[136],"provided":[139],"Experimental":[142],"results":[143],"obtained":[146],"from":[147],"real-life":[148],"matrices":[149],"show":[150],"quality":[153],"improved":[162],"significantly":[163],"most":[165],"hypergraphs.":[168],"order":[170,202],"increase":[172],"speed":[174,224],"up":[175],"search-space":[177],"exploration,":[178],"experimented":[180],"both":[182],"master-slave":[183],"workstealing":[185],"parallelization.":[186],"It":[187],"also":[188],"been":[190],"shown":[191],"runtime":[194],"algorithm":[197],"highly":[198],"depends":[199],"items":[205],"branch":[208],"bound":[210],"tree.":[211],"study,":[214],"different":[217],"ordering":[218],"strategies":[219],"offer":[222],"great":[223],"ups":[225],"depending":[226],"characteristics":[229]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2921849321","counts_by_year":[{"year":2022,"cited_by_count":2}],"updated_date":"2026-11-20T13:11:24.684918","created_date":"2019-03-22T00:00:00"}
