{"id":"https://openalex.org/W506101","doi":null,"title":"Graph partitioning and its applications to scientific computing","display_name":"Graph partitioning and its applications to scientific computing","alternate_titles":[],"publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W506101","mag":"506101"},"language":"en","primary_location":{"id":"mag:506101","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=923568","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},"parent_works":[],"lineage":["https://openalex.org/W506101"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5109364760","display_name":"Vipin Kumar","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Vipin Kumar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5082384108","display_name":"George Karypis","orcid":"https://orcid.org/0000-0003-2753-1437","observed_orcids":["https://orcid.org/0000-0003-2753-1437"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"George Karypis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1879,"has_fulltext":false,"cited_by_count":6,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.85392912,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.45969998836517334,"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"}},"topics":[{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.45969998836517334,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.15889999270439148,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.0982000008225441,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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-partitioning","display_name":"graph partitioning","score":0.9879999756813049},{"id":"https://openalex.org/keywords/graph-coarsening","display_name":"graph coarsening","score":0.7609999775886536},{"id":"https://openalex.org/keywords/graph-refinement","display_name":"graph refinement","score":0.5389999747276306},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"graph coloring","score":0.9580000042915344},{"id":"https://openalex.org/keywords/preconditioning","display_name":"preconditioning","score":0.8399999737739563},{"id":"https://openalex.org/keywords/scientific-computing","display_name":"scientific computing","score":0.492000013589859}],"concepts":[{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.8369163274765015},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6276782155036926},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4978659152984619},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4950989782810211},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.4712543785572052},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45991411805152893},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45878249406814575},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.31064820289611816},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2890721559524536},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25737279653549194},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10787969827651978}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:506101","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=923568","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":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2004951603","https://openalex.org/W7096932425","https://openalex.org/W1484151559","https://openalex.org/W2124200646","https://openalex.org/W2063597636","https://openalex.org/W2118953734","https://openalex.org/W7162680101","https://openalex.org/W1496877883","https://openalex.org/W4231846589","https://openalex.org/W97348994"],"abstract_inverted_index":{"Algorithms":[0],"that":[1,36,97,123,144,203,235],"find":[2],"a":[3,17,30,58,88,100,206,262,269,302],"good":[4],"partition":[5,102,131,259],"of":[6,20,32,40,68,77,91,103,111,149,192,196,209,224,228,306,334,343],"highly":[7,303],"unstructured":[8],"graphs":[9,260],"are":[10,163],"critical":[11],"in":[12,22,215,265,273,292,340],"developing":[13],"efficient":[14],"algorithms":[15,35,96,278,322],"for":[16,60,72,178],"wide":[18],"range":[19],"problems":[21],"many":[23,69],"application":[24,342],"areas.\r\nIn":[25],"this":[26,171,298],"dissertation":[27],"we":[28,173,300],"study":[29],"class":[31,90],"graph":[33,42,82,94,115,152,211,238],"partitioning":[34,83,95,116,153,187,232,317],"reduce":[37],"the":[38,41,49,61,66,74,104,140,150,179,184,197,210,213,229,244,248,251,327,332,335,341,344],"size":[39],"by":[43],"collapsing":[44],"vertices":[45,264],"and":[46,52,155,183,247,318],"edges,":[47],"bisect":[48],"smaller":[50],"graph,":[51],"then":[53],"uncoarsen":[54],"it":[55,204,236],"to":[56,159,165,212,217,240,288,323],"construct":[57],"bisection":[59,81,182,200],"original":[62],"graph.":[63,106],"We":[64,85,137],"investigate":[65],"effectiveness":[67],"different":[70],"choices":[71],"all":[73],"three":[75],"phases":[76],"these":[78,161],"multilevel":[79,92,113,151,180,185,198,230,315],"recursive":[80,181,199],"algorithms.":[84,309],"also":[86,138],"present":[87,139,174,301],"new":[89],"k-way":[93,101,114,130,186,231,256,316],"directly":[98],"compute":[99],"coarsest":[105],"A":[107,189],"key":[108,190,221],"innovative":[109,222],"feature":[110,191,223],"our":[112,193,225,313],"algorithm":[117,122,233,311],"is":[118,202,234],"an":[119,128],"inexpensive":[120],"refinement":[121,249],"can":[124,258],"substantially":[125],"improve":[126],"upon":[127],"initial":[129],"without":[132],"requiring":[133],"too":[134],"much":[135],"time.":[136],"first":[141],"theoretical":[142],"analysis":[143],"successfully":[145],"explains":[146],"certain":[147],"aspects":[148],"algorithms,":[154],"provides":[156],"insights":[157],"as":[158,329,331],"why":[160],"schemes":[162],"able":[164],"produce":[166],"very":[167],"high":[168],"quality":[169],"partitions.\r\nIn":[170],"thesis":[172,299],"parallel":[175,194,226,255,304,314],"formulations":[176],"both":[177,243,326],"algorithm.":[188],"formulation":[195,227,305],"algorithm,":[201,257],"uses":[205],"two-dimensional":[207],"distribution":[208],"processors":[214],"order":[216],"minimize":[218],"communication.":[219],"The":[220],"utilizes":[237,312],"coloring":[239],"effectively":[241,324],"parallelize":[242,325],"coarsening":[245],"phase":[246],"during":[250],"uncoarsening":[252],"phase.":[253],"Our":[254,310],"with":[261],"million":[263],"128":[266],"parts,":[267],"on":[268,280],"129-processor":[270],"Cray":[271],"T3D":[272],"little":[274],"over":[275],"two":[276],"seconds.\r\nFactorization":[277],"based":[279],"threshold":[281],"incomplete":[282],"LU":[283],"factorization":[284,308,328],"have":[285],"been":[286],"found":[287],"be":[289],"quite":[290],"effective":[291],"preconditioning":[293],"iterative":[294],"system":[295],"solvers.":[296],"In":[297],"such":[307],"independent":[319],"set":[320],"computation":[321],"well":[330],"solution":[333],"resulting":[336],"triangular":[337],"systems,":[338],"used":[339],"preconditioner.":[345]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W506101","counts_by_year":[],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
