{"id":"https://openalex.org/W2032599431","doi":"https://doi.org/10.1016/s1571-0661(04)81015-6","title":"Large 2-Independent Sets of Regular Graphs","display_name":"Large 2-Independent Sets of Regular Graphs","publication_year":2003,"publication_date":"2003-04-01","ids":{"openalex":"https://openalex.org/W2032599431","doi":"https://doi.org/10.1016/s1571-0661(04)81015-6","mag":"2032599431"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(04)81015-6","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)81015-6","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(04)81015-6","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009575159","display_name":"William Duckworth","orcid":null},"institutions":[{"id":"https://openalex.org/I99043593","display_name":"Macquarie University","ror":"https://ror.org/01sf06y89","country_code":"AU","type":"education","lineage":["https://openalex.org/I99043593"]},{"id":"https://openalex.org/I165779595","display_name":"University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"W. Duckworth","raw_affiliation_strings":["Department of Computing Macquarie University, Sydney, Australia","The University of Melbourne,"],"affiliations":[{"raw_affiliation_string":"Department of Computing Macquarie University, Sydney, Australia","institution_ids":["https://openalex.org/I99043593"]},{"raw_affiliation_string":"The University of Melbourne,","institution_ids":["https://openalex.org/I165779595"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013505086","display_name":"Michele Zito","orcid":null},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"M. Zito","raw_affiliation_strings":["Department of Computer Science, The University of Liverpool, Liverpool, UK","#N##TAB##TAB##TAB##TAB# University of Liverpool#N##TAB##TAB##TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Liverpool, Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]},{"raw_affiliation_string":"#N##TAB##TAB##TAB##TAB# University of Liverpool#N##TAB##TAB##TAB#","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5009575159","https://openalex.org/A5013505086"],"corresponding_institution_ids":["https://openalex.org/I146655781","https://openalex.org/I165779595","https://openalex.org/I99043593"],"apc_list":null,"apc_paid":null,"fwci":0.3637,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.60780233,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"78","issue":null,"first_page":"223","last_page":"235"},"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9995999932289124,"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"}},{"id":"https://openalex.org/T10849","display_name":"Finite Group Theory Research","score":0.998199999332428,"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/mathematics","display_name":"Mathematics","score":0.6526591777801514},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.6396830677986145},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6344610452651978},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5754212141036987},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5566730499267578},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5508100390434265},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4801856279373169},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47600898146629333},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.467888742685318},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.46390482783317566},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4626956582069397},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4529120922088623},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44043707847595215},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27156326174736023},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.24769854545593262},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.21696272492408752},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2121400237083435},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2063395380973816}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6526591777801514},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.6396830677986145},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6344610452651978},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5754212141036987},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5566730499267578},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5508100390434265},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4801856279373169},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47600898146629333},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.467888742685318},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.46390482783317566},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4626956582069397},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4529120922088623},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44043707847595215},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27156326174736023},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.24769854545593262},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21696272492408752},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2121400237083435},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2063395380973816},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s1571-0661(04)81015-6","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)81015-6","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.380.9854","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.380.9854","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cgi.csc.liv.ac.uk/~michele/PAPERI/2-iset.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(04)81015-6","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)81015-6","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W5090298","https://openalex.org/W1526359699","https://openalex.org/W1581220960","https://openalex.org/W1592213313","https://openalex.org/W1865375879","https://openalex.org/W1979720612","https://openalex.org/W2008704324","https://openalex.org/W2011039300","https://openalex.org/W2309179828","https://openalex.org/W2476096155","https://openalex.org/W2552070334","https://openalex.org/W2750828274","https://openalex.org/W2798588639","https://openalex.org/W2905110430","https://openalex.org/W4285719527","https://openalex.org/W6600215407","https://openalex.org/W6635493487"],"related_works":["https://openalex.org/W4283803822","https://openalex.org/W2157783000","https://openalex.org/W2963009577","https://openalex.org/W4287117052","https://openalex.org/W2788975631","https://openalex.org/W2903402681","https://openalex.org/W2966902162","https://openalex.org/W3176308333","https://openalex.org/W4206705200","https://openalex.org/W1968027460"],"abstract_inverted_index":{"We":[0,16],"present":[1],"a":[2,9,26,53],"simple,":[3],"yet":[4],"efficient,":[5],"heuristic":[6],"for":[7],"finding":[8],"large":[10],"2-independent":[11,55],"set":[12,56],"of":[13,21,52,57],"regular":[14,36,59],"graphs.":[15,60],"analyse":[17],"the":[18,49],"average-case":[19],"performance":[20,33],"this":[22,42],"heuristic,":[23],"which":[24],"is":[25],"randomised":[27],"greedy":[28],"algorithm,":[29],"by":[30],"analysing":[31],"its":[32],"on":[34,48],"random":[35,58],"graphs":[37],"using":[38],"differential":[39],"equations.":[40],"In":[41],"way,":[43],"we":[44],"prove":[45],"lower":[46],"bounds":[47],"expected":[50],"size":[51],"largest":[54],"Our":[61],"results":[62],"compare":[63],"favourably":[64],"with":[65],"corresponding":[66],"known":[67],"upper":[68],"bounds.":[69]},"counts_by_year":[{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}