{"id":"https://openalex.org/W2082001376","doi":"https://doi.org/10.1016/0167-6377(81)90020-1","title":"Weakly bipartite graphs and the Max-cut problem","display_name":"Weakly bipartite graphs and the Max-cut problem","publication_year":1981,"publication_date":"1981-10-01","ids":{"openalex":"https://openalex.org/W2082001376","doi":"https://doi.org/10.1016/0167-6377(81)90020-1","mag":"2082001376"},"language":"en","primary_location":{"id":"doi:10.1016/0167-6377(81)90020-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-6377(81)90020-1","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","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/A5057878065","display_name":"Martin Gr\u00f6tschel","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"M. Gr\u00f6tschel","raw_affiliation_strings":["Institut f\u00fcr Operations Research, Universit\u00e4t Bonn, Nassestr. 2, D-5300 Bonn 1, Fed. Rep. Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Operations Research, Universit\u00e4t Bonn, Nassestr. 2, D-5300 Bonn 1, Fed. Rep. Germany","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016219449","display_name":"William R. Pulleyblank","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"W.R. Pulleyblank","raw_affiliation_strings":["Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada","DEPARTMENT OF COMBINATORICS AND OPTIMIZATION; UNIVERSITY OF WATERLOO; WATERLOO ONTARIO CANADA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"DEPARTMENT OF COMBINATORICS AND OPTIMIZATION; UNIVERSITY OF WATERLOO; WATERLOO ONTARIO CANADA","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2760,"currency":"USD","value_usd":2760},"apc_paid":null,"fwci":4.5431,"has_fulltext":false,"cited_by_count":174,"citation_normalized_percentile":{"value":0.94009217,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"1","issue":"1","first_page":"23","last_page":"27"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9962999820709229,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9962999820709229,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9952999949455261,"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.9929999709129333,"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/combinatorics","display_name":"Combinatorics","score":0.866472601890564},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8567062616348267},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7382052540779114},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.5943459272384644},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.5079756379127502},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.5055067539215088},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.501495361328125},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4908238351345062},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4862760305404663},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.4823712408542633},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4659401476383209},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4354422092437744},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.43421316146850586},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4168494939804077},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.23681893944740295},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.21089401841163635}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.866472601890564},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8567062616348267},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7382052540779114},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.5943459272384644},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.5079756379127502},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.5055067539215088},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.501495361328125},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4908238351345062},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4862760305404663},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.4823712408542633},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4659401476383209},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4354422092437744},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.43421316146850586},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4168494939804077},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.23681893944740295},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.21089401841163635}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0167-6377(81)90020-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-6377(81)90020-1","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2010203872","https://openalex.org/W2011039300","https://openalex.org/W2012329067","https://openalex.org/W2045027193","https://openalex.org/W2073705438","https://openalex.org/W2327315803","https://openalex.org/W6615764100","https://openalex.org/W6661829240"],"related_works":["https://openalex.org/W4283803822","https://openalex.org/W2288749733","https://openalex.org/W1977862280","https://openalex.org/W1954384522","https://openalex.org/W2405987656","https://openalex.org/W2016277208","https://openalex.org/W2765547336","https://openalex.org/W2031276298","https://openalex.org/W110470963","https://openalex.org/W2906832313"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}