{"id":"https://openalex.org/W2059936808","doi":"https://doi.org/10.1137/0210054","title":"The NP-Completeness of Some Edge-Partition Problems","display_name":"The NP-Completeness of Some Edge-Partition Problems","publication_year":1981,"publication_date":"1981-11-01","ids":{"openalex":"https://openalex.org/W2059936808","doi":"https://doi.org/10.1137/0210054","mag":"2059936808"},"language":"en","primary_location":{"id":"doi:10.1137/0210054","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0210054","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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/A5023066919","display_name":"Ian Holyer","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ian Holyer","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5023066919"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7889,"has_fulltext":false,"cited_by_count":218,"citation_normalized_percentile":{"value":0.91072618,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":"10","issue":"4","first_page":"713","last_page":"717"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9994999766349792,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9987000226974487,"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.7288804054260254},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7155200839042664},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6523456573486328},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.5476060509681702},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.5217645764350891},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49726632237434387},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47828659415245056},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.45640361309051514},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.4319220781326294},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3274571895599365}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7288804054260254},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7155200839042664},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6523456573486328},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5476060509681702},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.5217645764350891},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49726632237434387},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47828659415245056},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.45640361309051514},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.4319220781326294},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3274571895599365},{"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.1137/0210054","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0210054","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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":1,"referenced_works":["https://openalex.org/W1975442866"],"related_works":["https://openalex.org/W4239075140","https://openalex.org/W1582679534","https://openalex.org/W3168334689","https://openalex.org/W1817539229","https://openalex.org/W4285411613","https://openalex.org/W2584414624","https://openalex.org/W4312440068","https://openalex.org/W1982865350","https://openalex.org/W3125301599","https://openalex.org/W2062731608"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2],"for":[3],"each":[4],"fixed":[5],"$n":[6],"\\geqq":[7],"3$":[8],"it":[9],"is":[10],"NP-complete":[11],"to":[12,24],"determine":[13],"whether":[14],"an":[15],"arbitrary":[16],"graph":[17,27],"can":[18],"be":[19],"edge-partitioned":[20],"into":[21],"subgraphs":[22],"isomorphic":[23],"the":[25],"complete":[26],"$K_n":[28],"$.":[29],"The":[30],"NP-completeness":[31],"of":[32,35],"a":[33],"number":[34],"other":[36],"edge-partition":[37],"problems":[38],"follows":[39],"immediately.":[40]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}