{"id":"https://openalex.org/W2134085311","doi":"https://doi.org/10.1137/0401030","title":"A New Heuristic for Partitioning the Nodes of a Graph","display_name":"A New Heuristic for Partitioning the Nodes of a Graph","publication_year":1988,"publication_date":"1988-08-01","ids":{"openalex":"https://openalex.org/W2134085311","doi":"https://doi.org/10.1137/0401030","mag":"2134085311"},"language":"en","primary_location":{"id":"doi:10.1137/0401030","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0401030","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","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/A5083031493","display_name":"Earl Barnes","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Earl R. Barnes","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036043351","display_name":"Anthony Vannelli","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anthony Vannelli","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5052653326","display_name":"James Q. Walker","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"James Q. Walker","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083031493"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5623,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":{"value":0.83986856,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"1","issue":"3","first_page":"299","last_page":"305"},"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.9995999932289124,"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.9995999932289124,"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.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/mathematics","display_name":"Mathematics","score":0.6122023463249207},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5670883059501648},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5440279245376587},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5191304087638855},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.48155954480171204},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.431611567735672},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35516881942749023},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32106947898864746}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6122023463249207},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5670883059501648},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5440279245376587},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5191304087638855},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48155954480171204},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.431611567735672},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35516881942749023},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32106947898864746}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0401030","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0401030","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1972215254","https://openalex.org/W2035409768","https://openalex.org/W2053264385","https://openalex.org/W2090739911","https://openalex.org/W2161455936"],"related_works":["https://openalex.org/W2980963558","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W1976691234","https://openalex.org/W4287664878","https://openalex.org/W3212023493","https://openalex.org/W2090715877","https://openalex.org/W4288278856"],"abstract_inverted_index":{"There":[0],"is":[1,46],"a":[2,53],"class":[3],"of":[4,19,42,59],"graph":[5],"partitioning":[6],"algorithms":[7,24],"which":[8],"improve":[9,66],"an":[10,67],"initial":[11,21,68],"partition":[12],"by":[13],"interchanging":[14],"nodes":[15,43,60],"between":[16],"the":[17,20,39],"subsets":[18],"partition.":[22,69],"These":[23],"tend":[25],"to":[26,44,61,65],"require":[27],"long":[28],"running":[29],"times":[30],"because":[31],"usually":[32],"many":[33],"trials":[34],"must":[35],"be":[36],"made":[37],"before":[38],"right":[40],"combination":[41],"interchange":[45,62],"found.":[47],"In":[48],"this":[49],"paper":[50],"we":[51],"describe":[52],"fast":[54],"procedure":[55],"for":[56],"determining":[57],"sets":[58],"in":[63],"order":[64]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}