{"id":"https://openalex.org/W1965758428","doi":"https://doi.org/10.1137/100810022","title":"Partitioning Hypergraphs in Scientific Computing Applications through Vertex Separators on Graphs","display_name":"Partitioning Hypergraphs in Scientific Computing Applications through Vertex Separators on Graphs","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W1965758428","doi":"https://doi.org/10.1137/100810022","mag":"1965758428"},"language":"en","primary_location":{"id":"doi:10.1137/100810022","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100810022","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific Computing","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/A5083968418","display_name":"Enver Kayaaslan","orcid":null},"institutions":[{"id":"https://openalex.org/I168864056","display_name":"Bilkent University","ror":"https://ror.org/02vh8a032","country_code":"TR","type":"education","lineage":["https://openalex.org/I168864056"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Enver Kayaaslan","raw_affiliation_strings":["enver@cs.bilkent.edu.tr and aykanat@cs.bilkent.edu.tr#TAB#"],"affiliations":[{"raw_affiliation_string":"enver@cs.bilkent.edu.tr and aykanat@cs.bilkent.edu.tr#TAB#","institution_ids":["https://openalex.org/I168864056"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068770852","display_name":"Ali P\u0131nar","orcid":"https://orcid.org/0000-0002-2641-7344"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ali Pinar","raw_affiliation_strings":["apinar@sandia.gov#TAB#"],"affiliations":[{"raw_affiliation_string":"apinar@sandia.gov#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026046737","display_name":"\u00dcmit V. \u00c7ataly\u00fcrek","orcid":"https://orcid.org/0000-0002-5625-3758"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"\u00dcmit \u00c7ataly\u00fcrek","raw_affiliation_strings":["umit@bmi.osu.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"umit@bmi.osu.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087435011","display_name":"Cevdet Aykanat","orcid":"https://orcid.org/0000-0002-4559-1321"},"institutions":[{"id":"https://openalex.org/I168864056","display_name":"Bilkent University","ror":"https://ror.org/02vh8a032","country_code":"TR","type":"education","lineage":["https://openalex.org/I168864056"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Cevdet Aykanat","raw_affiliation_strings":["Computer Engineering Department, Bilkent University, Ankara, Turkey"],"affiliations":[{"raw_affiliation_string":"Computer Engineering Department, Bilkent University, Ankara, Turkey","institution_ids":["https://openalex.org/I168864056"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5087435011"],"corresponding_institution_ids":["https://openalex.org/I168864056"],"apc_list":null,"apc_paid":null,"fwci":0.9986,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.77335845,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"34","issue":"2","first_page":"A970","last_page":"A992"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998999834060669,"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.9998999834060669,"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.9993000030517578,"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/hypergraph","display_name":"Hypergraph","score":0.7441080808639526},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5774553418159485},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5366408824920654},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42761147022247314},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.42466479539871216},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42184486985206604},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3543800711631775},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3400454521179199},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.24900758266448975}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.7441080808639526},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5774553418159485},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5366408824920654},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42761147022247314},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.42466479539871216},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42184486985206604},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3543800711631775},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3400454521179199},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.24900758266448975}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1137/100810022","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100810022","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.232.6043","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.232.6043","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://csmr.ca.sandia.gov/%7Eapinar/papers/NIG.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.232.6275","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.232.6275","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://csmr.ca.sandia.gov/%7Eapinar/papers/paper2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.310.5671","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.5671","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bilkent.edu.tr/~aykanat/SIAM-2012.pdf","raw_type":"text"},{"id":"pmh:oai:repository.bilkent.edu.tr:11693/13160","is_oa":false,"landing_page_url":"http://hdl.handle.net/11693/13160","pdf_url":null,"source":{"id":"https://openalex.org/S4306400079","display_name":"Bilkent University Institutional Repository (Bilkent University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I168864056","host_organization_name":"Bilkent University","host_organization_lineage":["https://openalex.org/I168864056"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"Article"},{"id":"pmh:oai:repository.bilkent.edu.tr:11693/21463","is_oa":false,"landing_page_url":"http://hdl.handle.net/11693/21463","pdf_url":null,"source":{"id":"https://openalex.org/S4306400079","display_name":"Bilkent University Institutional Repository (Bilkent University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I168864056","host_organization_name":"Bilkent University","host_organization_lineage":["https://openalex.org/I168864056"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.44999998807907104,"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":54,"referenced_works":["https://openalex.org/W1483770419","https://openalex.org/W1499467741","https://openalex.org/W1501783757","https://openalex.org/W1523198988","https://openalex.org/W1568711379","https://openalex.org/W1589954548","https://openalex.org/W1835164773","https://openalex.org/W1968128373","https://openalex.org/W1973113780","https://openalex.org/W1981885118","https://openalex.org/W1984283136","https://openalex.org/W1996309908","https://openalex.org/W2001885513","https://openalex.org/W2011601876","https://openalex.org/W2016440384","https://openalex.org/W2029644687","https://openalex.org/W2035080386","https://openalex.org/W2043517059","https://openalex.org/W2044490126","https://openalex.org/W2068084624","https://openalex.org/W2069277577","https://openalex.org/W2078174680","https://openalex.org/W2093992309","https://openalex.org/W2095117703","https://openalex.org/W2099237065","https://openalex.org/W2104192768","https://openalex.org/W2108219155","https://openalex.org/W2110002672","https://openalex.org/W2114030927","https://openalex.org/W2125095596","https://openalex.org/W2125690626","https://openalex.org/W2127927798","https://openalex.org/W2127975031","https://openalex.org/W2131509030","https://openalex.org/W2132685143","https://openalex.org/W2136380704","https://openalex.org/W2136871634","https://openalex.org/W2137541800","https://openalex.org/W2142184646","https://openalex.org/W2142496304","https://openalex.org/W2142644532","https://openalex.org/W2147799577","https://openalex.org/W2153873308","https://openalex.org/W2158598102","https://openalex.org/W2161455936","https://openalex.org/W2161845544","https://openalex.org/W2163501979","https://openalex.org/W2166811255","https://openalex.org/W2793467578","https://openalex.org/W3103552514","https://openalex.org/W3104001151","https://openalex.org/W3148370595","https://openalex.org/W4298420348","https://openalex.org/W4302764849"],"related_works":["https://openalex.org/W4376608589","https://openalex.org/W3138003926","https://openalex.org/W4300037846","https://openalex.org/W1630514295","https://openalex.org/W1537073411","https://openalex.org/W2963081352","https://openalex.org/W4376608938","https://openalex.org/W4288275998","https://openalex.org/W2472555608","https://openalex.org/W2552825874"],"abstract_inverted_index":{"Abstract.":[0],"The":[1,41],"modeling":[2,42,73],"flexibility":[3,43,74],"provided":[4],"by":[5,109,115,131,150,212,246],"hypergraphs":[6,45,53],"has":[7],"drawn":[8],"a":[9,34,49,133,151,163,168,216,224],"lot":[10],"of":[11,28,44,75,81,145,227,233],"interest":[12],"from":[13],"the":[14,72,78,88,99,111,127,146,198,231],"combinatorial":[15,38,241],"scientific":[16,39,242],"community,":[17],"leading":[18],"to":[19,65,95,125,171,190],"novel":[20],"models":[21],"and":[22,26,153,185,193,214],"algorithms,":[23],"their":[24,160],"applications,":[25],"development":[27],"associated":[29],"tools.":[30],"Hypergraphs":[31],"are":[32,54,188],"now":[33],"standard":[35],"tool":[36,219],"in":[37,68],"computing.":[40],"however,":[46],"comes":[47],"at":[48],"cost:":[50],"algorithms":[51,83],"on":[52,60,119,136,223],"inherently":[55],"more":[56],"complicated":[57],"than":[58],"those":[59],"graphs,":[61],"which":[62],"sometimes":[63],"translate":[64],"nontrivial":[66],"increases":[67],"processing":[69],"times.":[70],"Neither":[71],"hypergraphs,":[76,175],"nor":[77],"runtime":[79],"efficiency":[80],"graph":[82,140,244],"can":[84],"be":[85,93],"overlooked.":[86],"Therefore,":[87],"new":[89],"research":[90],"thrust":[91],"should":[92],"how":[94,124],"cleverly":[96],"trade-off":[97,108],"between":[98],"two.":[100],"This":[101],"work":[102],"addresses":[103],"one":[104],"method":[105],"for":[106,207],"this":[107],"solving":[110],"hypergraph":[112,128,147,239],"partitioning":[113,129,245],"problem":[114,130],"finding":[116],"vertex":[117,134,247],"separators":[118],"graphs.":[120],"Specifically,":[121],"we":[122],"investigate":[123],"solve":[126],"seeking":[132],"separator":[135],"its":[137],"net":[138,144],"intersection":[139],"(NIG),":[141],"where":[142],"each":[143],"is":[148],"represented":[149],"vertex,":[152],"two":[154],"vertices":[155],"share":[156],"an":[157,205],"edge":[158],"if":[159],"nets":[161],"have":[162],"common":[164],"vertex.":[165],"We":[166,202],"propose":[167],"vertex-weighting":[169],"scheme":[170],"attain":[172],"good":[173],"node-balanced":[174],"since":[176],"NIG":[177],"model":[178],"cannot":[179],"preserve":[180],"node":[181],"balancing":[182],"information.":[183],"Vertex-removal":[184],"vertex-splitting":[186],"techniques":[187],"described":[189],"optimize":[191],"cutnet":[192],"connectivity":[194],"metrics,":[195],"respectively,":[196],"under":[197],"recursive":[199],"bipartitioning":[200],"paradigm.":[201],"also":[203],"developed":[204],"implementation":[206],"our":[208,234],"GPVS-based":[209],"HP":[210],"formulations":[211],"adopting":[213],"modifying":[215],"state-of-the-art":[217],"GPVS":[218],"onmetis.":[220],"Experiments":[221],"conducted":[222],"large":[225],"collection":[226],"sparse":[228,249],"matrices":[229],"confirmed":[230],"validity":[232],"proposed":[235],"techniques.":[236],"Key":[237],"words.":[238],"partitioning;":[240],"computing;":[243],"separator;":[248],"matrices.":[250],"AMS":[251],"subject":[252],"classifications.":[253]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}