{"id":"https://openalex.org/W2016776056","doi":"https://doi.org/10.1016/0196-6774(89)90001-1","title":"The solution of some random NP-hard problems in polynomial expected time","display_name":"The solution of some random NP-hard problems in polynomial expected time","publication_year":1989,"publication_date":"1989-12-01","ids":{"openalex":"https://openalex.org/W2016776056","doi":"https://doi.org/10.1016/0196-6774(89)90001-1","mag":"2016776056"},"language":"en","primary_location":{"id":"doi:10.1016/0196-6774(89)90001-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0196-6774(89)90001-1","pdf_url":null,"source":{"id":"https://openalex.org/S110520077","display_name":"Journal of Algorithms","issn_l":"0196-6774","issn":["0196-6774","1090-2678"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319955","host_organization_name":"Academic Press","host_organization_lineage":["https://openalex.org/P4310319955","https://openalex.org/P4310320990"],"host_organization_lineage_names":["Academic Press","Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Algorithms","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/A5019297501","display_name":"Martin Dyer","orcid":"https://orcid.org/0000-0002-2018-0374"},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"M.E Dyer","raw_affiliation_strings":["Leeds University, Leeds, England","Leeds University Leeds, England"],"affiliations":[{"raw_affiliation_string":"Leeds University, Leeds, England","institution_ids":["https://openalex.org/I130828816"]},{"raw_affiliation_string":"Leeds University Leeds, England","institution_ids":["https://openalex.org/I130828816"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056950019","display_name":"Alan Frieze","orcid":"https://orcid.org/0000-0002-8481-5615"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]},{"id":"https://openalex.org/I166337079","display_name":"Queen Mary University of London","ror":"https://ror.org/026zzn846","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I166337079"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"A.M Frieze","raw_affiliation_strings":["Carnegie-Mellon University, Pittsburgh, and Queen Mary College, London, England"],"affiliations":[{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, and Queen Mary College, London, England","institution_ids":["https://openalex.org/I166337079","https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019297501"],"corresponding_institution_ids":["https://openalex.org/I130828816"],"apc_list":null,"apc_paid":null,"fwci":3.8273,"has_fulltext":false,"cited_by_count":196,"citation_normalized_percentile":{"value":0.94064902,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"10","issue":"4","first_page":"451","last_page":"489"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9995999932289124,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7714462280273438},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6602506637573242},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6460874080657959},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6448812484741211},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5810300707817078},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.4981708526611328},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44601112604141235},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4392770230770111}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7714462280273438},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6602506637573242},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6460874080657959},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6448812484741211},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5810300707817078},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.4981708526611328},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44601112604141235},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4392770230770111}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0196-6774(89)90001-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0196-6774(89)90001-1","pdf_url":null,"source":{"id":"https://openalex.org/S110520077","display_name":"Journal of Algorithms","issn_l":"0196-6774","issn":["0196-6774","1090-2678"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319955","host_organization_name":"Academic Press","host_organization_lineage":["https://openalex.org/P4310319955","https://openalex.org/P4310320990"],"host_organization_lineage_names":["Academic Press","Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Algorithms","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":9,"referenced_works":["https://openalex.org/W23397926","https://openalex.org/W1970776799","https://openalex.org/W2083883919","https://openalex.org/W2103012681","https://openalex.org/W2126641717","https://openalex.org/W2500154698","https://openalex.org/W2913222977","https://openalex.org/W4238472918","https://openalex.org/W6601480571"],"related_works":["https://openalex.org/W3161249280","https://openalex.org/W2267059662","https://openalex.org/W4388411807","https://openalex.org/W2364268683","https://openalex.org/W2478803962","https://openalex.org/W2583811263","https://openalex.org/W1598028160","https://openalex.org/W3173312668","https://openalex.org/W3012931947","https://openalex.org/W2035944803"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":16},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":21},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}