{"id":"https://openalex.org/W2612032746","doi":"https://doi.org/10.1145/3035918.3035939","title":"Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling","display_name":"Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling","publication_year":2017,"publication_date":"2017-05-09","ids":{"openalex":"https://openalex.org/W2612032746","doi":"https://doi.org/10.1145/3035918.3035939","mag":"2612032746"},"language":"en","primary_location":{"id":"doi:10.1145/3035918.3035939","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3035918.3035939","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2017 ACM International Conference on Management of Data","raw_type":"proceedings-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/A5037530341","display_name":"Lijun Chang","orcid":"https://orcid.org/0000-0002-6830-3900"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Lijun Chang","raw_affiliation_strings":["University of New South Wales, Sydney, Australia"],"affiliations":[{"raw_affiliation_string":"University of New South Wales, Sydney, Australia","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100317981","display_name":"Wei Li","orcid":"https://orcid.org/0000-0001-6261-1761"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Wei Li","raw_affiliation_strings":["University of New South Wales, Sydney, Australia"],"affiliations":[{"raw_affiliation_string":"University of New South Wales, Sydney, Australia","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100385498","display_name":"Wenjie Zhang","orcid":"https://orcid.org/0000-0001-6572-2600"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Wenjie Zhang","raw_affiliation_strings":["University of New South Wales, Sydney, Australia"],"affiliations":[{"raw_affiliation_string":"University of New South Wales, Sydney, Australia","institution_ids":["https://openalex.org/I31746571"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5037530341"],"corresponding_institution_ids":["https://openalex.org/I31746571"],"apc_list":null,"apc_paid":null,"fwci":4.7555,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.95655914,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1181","last_page":"1196"},"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","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/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/T12292","display_name":"Graph Theory and Algorithms","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/independent-set","display_name":"Independent set","score":0.6629880666732788},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.658602774143219},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6241588592529297},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5878188014030457},{"id":"https://openalex.org/keywords/graph-reduction","display_name":"Graph reduction","score":0.5854777693748474},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5694612860679626},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5675658583641052},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5188585519790649},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5171917676925659},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5079880356788635},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.44303980469703674},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4266173839569092},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.41316333413124084},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36524197459220886},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2706712484359741},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2455863058567047},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11428925395011902},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07487812638282776}],"concepts":[{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.6629880666732788},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.658602774143219},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6241588592529297},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5878188014030457},{"id":"https://openalex.org/C97042676","wikidata":"https://www.wikidata.org/wiki/Q5597097","display_name":"Graph reduction","level":3,"score":0.5854777693748474},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5694612860679626},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5675658583641052},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5188585519790649},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5171917676925659},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5079880356788635},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.44303980469703674},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4266173839569092},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.41316333413124084},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36524197459220886},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2706712484359741},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2455863058567047},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11428925395011902},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07487812638282776},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3035918.3035939","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3035918.3035939","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2017 ACM International Conference on Management of Data","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W42852446","https://openalex.org/W61567537","https://openalex.org/W587794248","https://openalex.org/W1442132175","https://openalex.org/W1531427460","https://openalex.org/W1574303240","https://openalex.org/W1581143440","https://openalex.org/W1594785451","https://openalex.org/W1599688444","https://openalex.org/W1832306393","https://openalex.org/W1892864924","https://openalex.org/W1972760347","https://openalex.org/W1977149746","https://openalex.org/W1983365058","https://openalex.org/W2003665833","https://openalex.org/W2008620264","https://openalex.org/W2011039300","https://openalex.org/W2055245094","https://openalex.org/W2060778826","https://openalex.org/W2070593017","https://openalex.org/W2074465184","https://openalex.org/W2076826101","https://openalex.org/W2081254453","https://openalex.org/W2082603400","https://openalex.org/W2089718638","https://openalex.org/W2096304152","https://openalex.org/W2098667053","https://openalex.org/W2122639972","https://openalex.org/W2144543704","https://openalex.org/W2148172281","https://openalex.org/W2156206152","https://openalex.org/W2159308691","https://openalex.org/W2161420356","https://openalex.org/W2209014286","https://openalex.org/W2251648435","https://openalex.org/W2289173650","https://openalex.org/W2314240464","https://openalex.org/W2423652555","https://openalex.org/W2476096155","https://openalex.org/W2513955757","https://openalex.org/W2719042323","https://openalex.org/W2764587448","https://openalex.org/W2946046356","https://openalex.org/W3145128584","https://openalex.org/W4285719527","https://openalex.org/W6634263952","https://openalex.org/W6645985281","https://openalex.org/W6652609139","https://openalex.org/W6791920267","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W2103112216","https://openalex.org/W1963654174","https://openalex.org/W3030122542","https://openalex.org/W2804969619","https://openalex.org/W2057124519","https://openalex.org/W4301100693","https://openalex.org/W2133859997","https://openalex.org/W2977583296","https://openalex.org/W2187700168","https://openalex.org/W2296729072"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2,276],"the":[3,24,43,69,114,131,134,139,160,180,268,288,305],"problem":[4,18],"of":[5,27,233],"efficiently":[6,205],"computing":[7,28,52],"a":[8,13,16,53,93,99,108,186,191,223,245,250,294],"maximum":[9,31,37,54,251],"independent":[10,32,38,55,96,177,226,235,252,259,285],"set":[11,33,39,56,97,236,253],"from":[12,98],"large":[14],"graph,":[15],"fundamental":[17],"in":[19,60,75,101,229,241],"graph":[20,100,115],"analysis.":[21],"Due":[22],"to":[23,47,80,219,231,248,266],"hardness":[25],"results":[26],"an":[29,35,234],"exact":[30],"or":[34,86],"approximate":[36],"with":[40,57,123,133],"accuracy":[41,64],"guarantee,":[42],"existing":[44,70,161,181,269,289,306],"algorithms":[45,83,172,281,291],"resort":[46],"heuristic":[48],"techniques":[49,71,203,265],"for":[50,164,204],"approximately":[51],"good":[58,246],"performance":[59],"practice":[61,242],"but":[62,221],"no":[63],"guarantee":[65],"theoretically.":[66],"Observing":[67],"that":[68,90,232,278],"have":[72],"various":[73],"limits,":[74],"this":[76],"paper,":[77],"we":[78,106,150,184,262],"aim":[79],"develop":[81,107],"efficient":[82],"(with":[84],"linear":[85],"near-linear":[87,192],"time":[88,193,216],"complexity)":[89],"can":[91,173],"generate":[92,174,249],"high-quality":[94],"(large-size)":[95],"practice.":[102],"In":[103,211],"particular,":[104],"firstly":[105],"Reducing-Peeling":[109],"framework":[110,149],"which":[111],"iteratively":[112],"reduces":[113],"size":[116,230],"by":[117,158,196,238],"applying":[118,208],"reduction":[119,140,162,199,209],"rules":[120,141,163,200],"on":[121,147],"vertices":[122],"very":[124],"low":[125],"degrees":[126],"(Reducing)":[127],"and":[128,156,167,190,201,206,217,254],"temporarily":[129],"removing":[130],"vertex":[132],"highest":[135],"degree":[136],"(Peeling)":[137],"if":[138],"cannot":[142],"be":[143],"applied.":[144],"Secondly,":[145],"based":[146],"our":[148,264,280],"design":[151],"two":[152],"baseline":[153],"algorithms,":[154],"BDOne":[155,220],"BDTwo,":[157],"utilizing":[159],"handling":[165],"degree-one":[166],"degree-two":[168],"vertices,":[169],"respectively.":[170],"Both":[171],"higher-quality":[175],"(larger-size)":[176],"sets":[178,286],"than":[179,287],"algorithms.":[182,273,310],"Thirdly,":[183],"propose":[185],"linear-time":[187,290],"algorithm,":[188,194],"LinearTime,":[189],"NearLinear,":[195],"designing":[197],"new":[198],"developing":[202],"incrementally":[207],"rules.":[210],"practice,":[212],"LinearTime":[213],"takes":[214],"similar":[215,228,295],"space":[218],"computes":[222],"higher":[224],"quality":[225],"set,":[227],"generated":[237],"BDTwo.":[239],"Moreover,":[240],"NearLinear":[243],"has":[244],"chance":[247],"it":[255],"often":[256],"generates":[257],"near-maximum":[258],"sets.":[260],"Fourthly,":[261],"extend":[263],"accelerate":[267],"iterated":[270,307],"local":[271,308],"search":[272,309],"Extensive":[274],"empirical":[275],"show":[277],"all":[279],"output":[282],"much":[283],"larger":[284],"while":[292],"having":[293],"running":[296],"time,":[297],"as":[298,300],"well":[299],"achieve":[301],"significant":[302],"speedup":[303],"against":[304]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":5}],"updated_date":"2026-04-02T15:55:50.835912","created_date":"2025-10-10T00:00:00"}