{"id":"https://openalex.org/W1630594658","doi":"https://doi.org/10.1017/s0963548318000123","title":"An Average Case NP-complete Graph Colouring Problem","display_name":"An Average Case NP-complete Graph Colouring Problem","publication_year":2018,"publication_date":"2018-04-02","ids":{"openalex":"https://openalex.org/W1630594658","doi":"https://doi.org/10.1017/s0963548318000123","mag":"1630594658"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548318000123","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548318000123","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/cs/0112001","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"LEONID A. LEVIN","orcid":null},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"LEONID A. LEVIN","raw_affiliation_strings":["Department of Computer Science, Boston University, 111 Cummington Mall, Boston, MA 02215, USA (home page: www.cs.bu.edu/fac/lnd/"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Boston University, 111 Cummington Mall, Boston, MA 02215, USA (home page: www.cs.bu.edu/fac/lnd/","institution_ids":["https://openalex.org/I111088046"]}]},{"author_position":"last","author":{"id":null,"display_name":"RAMARATHNAM VENKATESAN","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"RAMARATHNAM VENKATESAN","raw_affiliation_strings":["Microsoft Research, One Microsoft Way, Redmond, WA 98052, USA (e-mail:"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, One Microsoft Way, Redmond, WA 98052, USA (e-mail:","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I111088046"],"apc_list":null,"apc_paid":null,"fwci":0.2137,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.50646762,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"27","issue":"5","first_page":"808","last_page":"828"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.5877000093460083,"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.5877000093460083,"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.21359999477863312,"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.05040000006556511,"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/graph","display_name":"Graph","score":0.5239999890327454},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.4081999957561493},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.40610000491142273},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.2872999906539917},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.27399998903274536}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7070000171661377},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6305000185966492},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5239999890327454},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4763000011444092},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.4081999957561493},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.40610000491142273},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.2872999906539917},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.27399998903274536},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.2702000141143799},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.26019999384880066},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.2524999976158142}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s0963548318000123","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548318000123","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:cs/0112001","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0112001","pdf_url":"https://arxiv.org/pdf/cs/0112001","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:cs/0112001","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0112001","pdf_url":"https://arxiv.org/pdf/cs/0112001","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W390146837","https://openalex.org/W1993375595","https://openalex.org/W2012473793","https://openalex.org/W2015810299","https://openalex.org/W2015908112","https://openalex.org/W2021320809","https://openalex.org/W2028907144","https://openalex.org/W2037426925","https://openalex.org/W2051748083","https://openalex.org/W2061496873","https://openalex.org/W2074876220","https://openalex.org/W2079212748","https://openalex.org/W2100008268","https://openalex.org/W2100201258","https://openalex.org/W2107993699","https://openalex.org/W2114664664","https://openalex.org/W2117362057","https://openalex.org/W2136086442","https://openalex.org/W2142048307","https://openalex.org/W2164284862","https://openalex.org/W2170261589","https://openalex.org/W2963205446","https://openalex.org/W3144959161","https://openalex.org/W3150645827","https://openalex.org/W4238118247"],"related_works":[],"abstract_inverted_index":{"NP-complete":[0],"problems":[1,53],"should":[2],"be":[3,11,29],"hard":[4,47],"on":[5,48],"some":[6],"instances":[7,16,37,75],"but":[8],"those":[9],"may":[10],"extremely":[12],"rare.":[13],"On":[14],"generic":[15],"many":[17],"such":[18],"problems,":[19],"especially":[20],"related":[21],"to":[22,28],"random":[23,36,87],"graphs,":[24],"have":[25],"been":[26],"proved":[27],"easy.":[30,65],"We":[31],"show":[32],"the":[33],"intractability":[34],"of":[35,38,80,94],"a":[39,77],"graph":[40,44],"colouring":[41],"problem:":[42],"this":[43],"problem":[45],"is":[46],"average":[49],"unless":[50],"all":[51,55],"NP":[52],"under":[54],"samplable":[56],"(":[57],"i.e.":[58],"generatable":[59],"in":[60],"polynomial":[61],"time)":[62],"distributions":[63],"are":[64],"Worst":[66],"case":[67],"reductions":[68],"use":[69],"special":[70],"gadgets":[71],"and":[72,89],"typically":[73],"map":[74],"into":[76],"negligible":[78],"fraction":[79],"possible":[81],"outputs.":[82],"Ours":[83],"must":[84],"output":[85],"nearly":[86],"graphs":[88],"avoid":[90],"any":[91],"super-polynomial":[92],"distortion":[93],"probabilities.":[95],"This":[96],"poses":[97],"significant":[98],"technical":[99],"difficulties.":[100]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}