{"id":"https://openalex.org/W2086041504","doi":"https://doi.org/10.1017/s0963548306007553","title":"Finding Large Independent Sets in Polynomial Expected Time","display_name":"Finding Large Independent Sets in Polynomial Expected Time","publication_year":2006,"publication_date":"2006-07-31","ids":{"openalex":"https://openalex.org/W2086041504","doi":"https://doi.org/10.1017/s0963548306007553","mag":"2086041504"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548306007553","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548306007553","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/5E3D61E4D6CF25E54966D5AEE80BB981/S0963548306007553a.pdf/div-class-title-finding-large-independent-sets-in-polynomial-expected-time-div.pdf","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":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/5E3D61E4D6CF25E54966D5AEE80BB981/S0963548306007553a.pdf/div-class-title-finding-large-independent-sets-in-polynomial-expected-time-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044991483","display_name":"Amin Coja\u2010Oghlan","orcid":"https://orcid.org/0000-0002-7350-1418"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"AMIN COJA-OGHLAN","raw_affiliation_strings":["Humboldt-Universit\u00e4t zu Berlin, Institut f\u00fcr Informatik, Unter den Linden 6, 10099 Berlin, Germany (e-mail:","Humboldt-Universit\u00e4t zu Berlin, Institut f\u00fcr Informatik, Unter den Linden 6, 10099 Berlin, Germany (e-mail: coja@informatik.hu-berlin.de)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Humboldt-Universit\u00e4t zu Berlin, Institut f\u00fcr Informatik, Unter den Linden 6, 10099 Berlin, Germany (e-mail:","institution_ids":["https://openalex.org/I39343248"]},{"raw_affiliation_string":"Humboldt-Universit\u00e4t zu Berlin, Institut f\u00fcr Informatik, Unter den Linden 6, 10099 Berlin, Germany (e-mail: coja@informatik.hu-berlin.de)","institution_ids":["https://openalex.org/I39343248"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5044991483"],"corresponding_institution_ids":["https://openalex.org/I39343248"],"apc_list":null,"apc_paid":null,"fwci":0.3241,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.63766816,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"15","issue":"5","first_page":"731","last_page":"751"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8567389249801636},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6772570610046387},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.6428669691085815},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5708313584327698},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4788227677345276},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4383585453033447},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.41601866483688354},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09343001246452332}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8567389249801636},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6772570610046387},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.6428669691085815},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5708313584327698},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4788227677345276},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4383585453033447},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.41601866483688354},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09343001246452332},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0963548306007553","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548306007553","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/5E3D61E4D6CF25E54966D5AEE80BB981/S0963548306007553a.pdf/div-class-title-finding-large-independent-sets-in-polynomial-expected-time-div.pdf","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"}],"best_oa_location":{"id":"doi:10.1017/s0963548306007553","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548306007553","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/5E3D61E4D6CF25E54966D5AEE80BB981/S0963548306007553a.pdf/div-class-title-finding-large-independent-sets-in-polynomial-expected-time-div.pdf","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2086041504.pdf","grobid_xml":"https://content.openalex.org/works/W2086041504.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W1492831324","https://openalex.org/W1547089046","https://openalex.org/W1548134571","https://openalex.org/W1574864566","https://openalex.org/W1605711022","https://openalex.org/W1987178221","https://openalex.org/W2010601719","https://openalex.org/W2011869755","https://openalex.org/W2012464972","https://openalex.org/W2023212718","https://openalex.org/W2061109699","https://openalex.org/W2062307640","https://openalex.org/W2069816168","https://openalex.org/W2078758709","https://openalex.org/W2079330337","https://openalex.org/W2081254453","https://openalex.org/W2088164510","https://openalex.org/W2088272899","https://openalex.org/W2100440346","https://openalex.org/W2138163102","https://openalex.org/W2166602562","https://openalex.org/W3005721417","https://openalex.org/W3082999210","https://openalex.org/W3123439476","https://openalex.org/W3144881883","https://openalex.org/W4237675686","https://openalex.org/W4249343322","https://openalex.org/W4253491426","https://openalex.org/W4297399141","https://openalex.org/W4300645277"],"related_works":["https://openalex.org/W2378491141","https://openalex.org/W2296729072","https://openalex.org/W2187700168","https://openalex.org/W1519201794","https://openalex.org/W1629505938","https://openalex.org/W3021108537","https://openalex.org/W2767824041","https://openalex.org/W1987322712","https://openalex.org/W2905396358","https://openalex.org/W2562183348"],"abstract_inverted_index":{"We":[0,77],"consider":[1],"instances":[2],"of":[3,30,89],"the":[4,14,41,73,113],"maximum":[5],"independent":[6,87],"set":[7,29,88],"problem":[8,118],"that":[9,62,81,99,111],"are":[10],"constructed":[11],"according":[12],"to":[13,60],"following":[15],"semirandom":[16],"model.":[17],"Let":[18],"$G_{n,p}$":[19],"be":[20,27,40],"a":[21,28,103],"random":[22],"graph,":[23],"and":[24],"let":[25,38],"$S$":[26,52,69],"$k$":[31],"vertices,":[32],"chosen":[33],"uniformly":[34],"at":[35],"random.":[36],"Then,":[37],"$G_0$":[39,61],"graph":[42],"obtained":[43],"by":[44],"deleting":[45],"all":[46],"edges":[47,59],"connecting":[48],"two":[49,66],"vertices":[50,67],"in":[51,68,112],".":[53,76,107],"Finally,":[54],"an":[55,79,86],"adversary":[56],"may":[57],"add":[58],"do":[63],"not":[64],"connect":[65],",":[70,97],"thereby":[71],"producing":[72],"instance":[74],"$G=G_{n,p,k}^*$":[75,84],"present":[78],"algorithm":[80],"on":[82],"input":[83],"finds":[85],"size":[90],"$\\geq":[91],"k$":[92],"within":[93],"polynomial":[94],"expected":[95],"time":[96],"provided":[98],"$k\\geq":[100],"C(n/p)^{1/2}$":[101],"for":[102],"certain":[104],"constant":[105],"$C>0$":[106],"Moreover,":[108],"we":[109],"prove":[110],"case":[114],"$k\\leq":[115],"(1-\\varepsilon)\\ln(n)/p$":[116],"this":[117],"is":[119],"hard.":[120]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}