{"id":"https://openalex.org/W2074729689","doi":"https://doi.org/10.1007/s00453-014-9883-7","title":"A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP","display_name":"A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP","publication_year":2014,"publication_date":"2014-05-02","ids":{"openalex":"https://openalex.org/W2074729689","doi":"https://doi.org/10.1007/s00453-014-9883-7","mag":"2074729689"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-014-9883-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-014-9883-7","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://discovery.dundee.ac.uk/files/6880233/edwmcd_2_.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101571000","display_name":"Keith Edwards","orcid":"https://orcid.org/0009-0006-9223-9749"},"institutions":[{"id":"https://openalex.org/I177639307","display_name":"University of Dundee","ror":"https://ror.org/03h2bxq36","country_code":"GB","type":"education","lineage":["https://openalex.org/I177639307"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Keith Edwards","raw_affiliation_strings":["School of Computing, University of Dundee, Dundee\u00a0, DD1 4HN, UK","School of Computing, University of Dundee, Dundee, UK DD1 4HN#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computing, University of Dundee, Dundee\u00a0, DD1 4HN, UK","institution_ids":["https://openalex.org/I177639307"]},{"raw_affiliation_string":"School of Computing, University of Dundee, Dundee, UK DD1 4HN#TAB#","institution_ids":["https://openalex.org/I177639307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109047676","display_name":"Eric McDermid","orcid":null},"institutions":[{"id":"https://openalex.org/I4210112676","display_name":"Koo & Associates International (United States)","ror":"https://ror.org/01v392555","country_code":"US","type":"company","lineage":["https://openalex.org/I4210112676"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eric McDermid","raw_affiliation_strings":["Austin, TX, USA",", Austin, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Austin, TX, USA","institution_ids":[]},{"raw_affiliation_string":", Austin, USA#TAB#","institution_ids":["https://openalex.org/I4210112676"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101571000"],"corresponding_institution_ids":["https://openalex.org/I177639307"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.1028,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.79051397,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"72","issue":"4","first_page":"940","last_page":"968"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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.9994000196456909,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9991999864578247,"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/mathematics","display_name":"Mathematics","score":0.7530105710029602},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.7455796599388123},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6495881676673889},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5878684520721436},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5162801146507263},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4909365475177765},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.4797878861427307},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.45325735211372375},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.44144490361213684},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.41828081011772156},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3336418867111206},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1869868040084839},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.170171856880188}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7530105710029602},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.7455796599388123},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6495881676673889},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5878684520721436},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5162801146507263},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4909365475177765},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4797878861427307},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.45325735211372375},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.44144490361213684},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.41828081011772156},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3336418867111206},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1869868040084839},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.170171856880188},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-014-9883-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-014-9883-7","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:discovery.dundee.ac.uk:openaire/c1d55881-e676-417d-b89a-43480fd4f770","is_oa":true,"landing_page_url":"https://discovery.dundee.ac.uk/en/publications/c1d55881-e676-417d-b89a-43480fd4f770","pdf_url":"https://discovery.dundee.ac.uk/files/6880233/edwmcd_2_.pdf","source":{"id":"https://openalex.org/S4306400523","display_name":"Discovery Research Portal (University of Dundee)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177639307","host_organization_name":"University of Dundee","host_organization_lineage":["https://openalex.org/I177639307"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Edwards, K & McDermid, E 2015, 'A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP', Algorithmica, vol. 72, no. 4, pp. 940-968. https://doi.org/10.1007/s00453-014-9883-7","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:discovery.dundee.ac.uk:openaire/c1d55881-e676-417d-b89a-43480fd4f770","is_oa":true,"landing_page_url":"https://discovery.dundee.ac.uk/en/publications/c1d55881-e676-417d-b89a-43480fd4f770","pdf_url":"https://discovery.dundee.ac.uk/files/6880233/edwmcd_2_.pdf","source":{"id":"https://openalex.org/S4306400523","display_name":"Discovery Research Portal (University of Dundee)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177639307","host_organization_name":"University of Dundee","host_organization_lineage":["https://openalex.org/I177639307"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Edwards, K & McDermid, E 2015, 'A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP', Algorithmica, vol. 72, no. 4, pp. 940-968. https://doi.org/10.1007/s00453-014-9883-7","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2074729689.pdf","grobid_xml":"https://content.openalex.org/works/W2074729689.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W152886480","https://openalex.org/W1465199488","https://openalex.org/W1491051759","https://openalex.org/W1564233884","https://openalex.org/W1571792361","https://openalex.org/W1593916827","https://openalex.org/W1841339196","https://openalex.org/W1871983861","https://openalex.org/W1896404939","https://openalex.org/W1983992721","https://openalex.org/W2005059149","https://openalex.org/W2010651583","https://openalex.org/W2015963099","https://openalex.org/W2029489766","https://openalex.org/W2035135174","https://openalex.org/W2036185701","https://openalex.org/W2039389937","https://openalex.org/W2041669358","https://openalex.org/W2071177062","https://openalex.org/W2081438146","https://openalex.org/W2084732238","https://openalex.org/W2087083200","https://openalex.org/W2089718638","https://openalex.org/W2094122366","https://openalex.org/W2097844290","https://openalex.org/W2141063223","https://openalex.org/W2153822011","https://openalex.org/W2154399201","https://openalex.org/W2154474334","https://openalex.org/W2168336253","https://openalex.org/W2170702810","https://openalex.org/W2895952552","https://openalex.org/W2962728077","https://openalex.org/W4247832516","https://openalex.org/W4256152130"],"related_works":["https://openalex.org/W1511821218","https://openalex.org/W2175868772","https://openalex.org/W1587078595","https://openalex.org/W239742334","https://openalex.org/W2124176527","https://openalex.org/W1480846237","https://openalex.org/W1544821268","https://openalex.org/W1548014395","https://openalex.org/W3037533092","https://openalex.org/W1726008105"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-03-17T17:19:04.345684","created_date":"2025-10-10T00:00:00"}