{"id":"https://openalex.org/W2032950184","doi":"https://doi.org/10.1145/800119.803884","title":"Some simplified NP-complete problems","display_name":"Some simplified NP-complete problems","publication_year":1974,"publication_date":"1974-01-01","ids":{"openalex":"https://openalex.org/W2032950184","doi":"https://doi.org/10.1145/800119.803884","mag":"2032950184"},"language":"en","primary_location":{"id":"doi:10.1145/800119.803884","doi":"https://doi.org/10.1145/800119.803884","is_oa":true,"landing_page_url":"https://doi.org/10.1145/800119.803884","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/800119.803884","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the sixth annual ACM symposium on Theory of computing - STOC '74","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/800119.803884","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047995033","display_name":"Michael R. Garey","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. R. Garey","raw_affiliation_strings":["","Bell Laboratories Murray Hill, New Jersey","Massachusetts Institute of Technology Cambridge, Massachusetts"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"","institution_ids":[]},{"raw_affiliation_string":"Bell Laboratories Murray Hill, New Jersey","institution_ids":[]},{"raw_affiliation_string":"Massachusetts Institute of Technology Cambridge, Massachusetts","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014391544","display_name":"D. S. Johnson","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. S. Johnson","raw_affiliation_strings":["","Bell Laboratories Murray Hill, New Jersey","Massachusetts Institute of Technology Cambridge, Massachusetts"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"","institution_ids":[]},{"raw_affiliation_string":"Bell Laboratories Murray Hill, New Jersey","institution_ids":[]},{"raw_affiliation_string":"Massachusetts Institute of Technology Cambridge, Massachusetts","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111558966","display_name":"Larry J. Stockmeyer","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"L. Stockmeyer","raw_affiliation_strings":["","Bell Laboratories Murray Hill, New Jersey","Massachusetts Institute of Technology Cambridge, Massachusetts"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"","institution_ids":[]},{"raw_affiliation_string":"Bell Laboratories Murray Hill, New Jersey","institution_ids":[]},{"raw_affiliation_string":"Massachusetts Institute of Technology Cambridge, Massachusetts","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":6.4728,"has_fulltext":true,"cited_by_count":686,"citation_normalized_percentile":{"value":0.97986577,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"47","last_page":"63"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.7050999999046326,"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":0.7050999999046326,"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.2946999967098236,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/np-completeness","display_name":"NP-completeness","score":0.921999990940094},{"id":"https://openalex.org/keywords/restricted-domains","display_name":"restricted domains","score":0.6449999809265137},{"id":"https://openalex.org/keywords/max-cut","display_name":"MaxCut","score":0.7770000100135803},{"id":"https://openalex.org/keywords/linear-arrangement","display_name":"linear arrangement","score":0.703000009059906},{"id":"https://openalex.org/keywords/planar-graphs","display_name":"planar graphs","score":0.9399999976158142},{"id":"https://openalex.org/keywords/hamiltonian-cycles","display_name":"Hamiltonian cycles","score":0.8370000123977661},{"id":"https://openalex.org/keywords/intractability","display_name":"computational intractability","score":0.925000011920929}],"concepts":[{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.7022081017494202},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.660237193107605},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.6519579887390137},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5942638516426086},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.5888046026229858},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.5684504508972168},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5210551619529724},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49400025606155396},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4739004671573639},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.44636014103889465},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43084457516670227},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4132165312767029},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40752798318862915},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23156774044036865},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/800119.803884","doi":"https://doi.org/10.1145/800119.803884","is_oa":true,"landing_page_url":"https://doi.org/10.1145/800119.803884","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/800119.803884","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the sixth annual ACM symposium on Theory of computing - STOC '74","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/800119.803884","doi":"https://doi.org/10.1145/800119.803884","is_oa":true,"landing_page_url":"https://doi.org/10.1145/800119.803884","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/800119.803884","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the sixth annual ACM symposium on Theory of computing - STOC '74","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2032950184.pdf","grobid_xml":"https://content.openalex.org/works/W2032950184.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1579391414","https://openalex.org/W1843974934","https://openalex.org/W1973310391","https://openalex.org/W1981455469","https://openalex.org/W1996473026","https://openalex.org/W2002680893","https://openalex.org/W2014404405","https://openalex.org/W2022971294","https://openalex.org/W2036265926","https://openalex.org/W2040924621","https://openalex.org/W2042986967","https://openalex.org/W2046063196","https://openalex.org/W2052850644","https://openalex.org/W2058200712","https://openalex.org/W2064535593","https://openalex.org/W2078007422","https://openalex.org/W2161455936","https://openalex.org/W2289048564","https://openalex.org/W2401610261","https://openalex.org/W2544415776","https://openalex.org/W3034528871","https://openalex.org/W4249484615","https://openalex.org/W6649331163"],"related_works":["https://openalex.org/W2030087828","https://openalex.org/W2021223188","https://openalex.org/W2101400962","https://openalex.org/W2083701035","https://openalex.org/W101322347","https://openalex.org/W2012931553","https://openalex.org/W3202889369","https://openalex.org/W1515900222","https://openalex.org/W54783058","https://openalex.org/W2067078311"],"abstract_inverted_index":{"It":[0],"is":[1,11],"widely":[2],"believed":[3],"that":[4,23,71,96],"showing":[5],"a":[6,24,58],"problem":[7],"to":[8,13,53,87,110],"be":[9],"NP-complete":[10,27,30,103],"tantamount":[12],"proving":[14],"its":[15],"computational":[16],"intractability.":[17],"In":[18],"this":[19],"paper":[20],"we":[21,39,125],"show":[22,40,70],"number":[25],"of":[26,43,62,76],"problems":[28,84,92,101,139],"remain":[29,93,102,140],"even":[31,72,104],"when":[32,105],"their":[33,106],"domains":[34,75,107],"are":[35,85,108],"substantially":[36],"restricted.":[37],"First":[38],"the":[41,60,63,74,77,90,128,138],"completeness":[42,61],"SIMPLE":[44],"MAX":[45],"CUT":[46,48],"(MAX":[47],"with":[49,112],"edge":[50],"weights":[51],"restricted":[52,86,109],"value":[54],"1),":[55],"and,":[56],"as":[57],"corollary,":[59],"OPTIMAL":[64],"LINEAR":[65],"ARRANGEMENT":[66],"problem.":[67],"We":[68],"then":[69],"if":[73],"NODE":[78,119],"COVER":[79],"and":[80,95,98,121],"DIRECTED":[81],"HAMILTONIAN":[82,123],"PATH":[83],"planar":[88],"graphs,":[89],"two":[91],"NP-complete,":[94],"these":[97],"other":[99],"graph":[100],"graphs":[111],"low":[113],"node":[114,134],"degrees.":[115],"For":[116],"GRAPH":[117],"3-COLORABILITY,":[118],"COVER,":[120],"UNDIRECTED":[122],"CIRCUIT,":[124],"determine":[126],"essentially":[127],"lowest":[129],"possible":[130],"upper":[131],"bounds":[132],"on":[133],"degree":[135],"for":[136],"which":[137],"NP-complete.":[141]},"counts_by_year":[{"year":2026,"cited_by_count":40},{"year":2025,"cited_by_count":29},{"year":2024,"cited_by_count":41},{"year":2023,"cited_by_count":28},{"year":2022,"cited_by_count":43},{"year":2021,"cited_by_count":39},{"year":2020,"cited_by_count":42},{"year":2019,"cited_by_count":32},{"year":2018,"cited_by_count":32},{"year":2017,"cited_by_count":22},{"year":2016,"cited_by_count":29},{"year":2015,"cited_by_count":34},{"year":2014,"cited_by_count":28},{"year":2013,"cited_by_count":27},{"year":2012,"cited_by_count":22}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}