{"id":"https://openalex.org/W2042977557","doi":"https://doi.org/10.1137/0211055","title":"An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs","display_name":"An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs","publication_year":1982,"publication_date":"1982-11-01","ids":{"openalex":"https://openalex.org/W2042977557","doi":"https://doi.org/10.1137/0211055","mag":"2042977557"},"language":"en","primary_location":{"id":"doi:10.1137/0211055","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0211055","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5048417287","display_name":"Norishige Chiba","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Norishige Chiba","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033580185","display_name":"Takao Nishizeki","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Takao Nishizeki","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5111983740","display_name":"Nobuji Saito","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nobuji Saito","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6493,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.83962264,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"11","issue":"4","first_page":"663","last_page":"675"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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.9994999766349792,"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.9993000030517578,"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/T12288","display_name":"Optimization and Search Problems","score":0.9970999956130981,"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/independent-set","display_name":"Independent set","score":0.8010969758033752},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.798283576965332},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.718010663986206},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.637261152267456},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5699716210365295},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5535118579864502},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5465143322944641},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46509066224098206},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4435083866119385},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42076414823532104},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.25946009159088135},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.24843981862068176},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12834694981575012}],"concepts":[{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.8010969758033752},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.798283576965332},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.718010663986206},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.637261152267456},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5699716210365295},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5535118579864502},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5465143322944641},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46509066224098206},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4435083866119385},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42076414823532104},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.25946009159088135},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.24843981862068176},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12834694981575012},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0211055","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0211055","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/W1650979692","https://openalex.org/W1655990431","https://openalex.org/W1656795039","https://openalex.org/W1984627834","https://openalex.org/W1987374783","https://openalex.org/W2002089154","https://openalex.org/W2030781850","https://openalex.org/W4213214460","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W2103112216","https://openalex.org/W3030122542","https://openalex.org/W1963654174","https://openalex.org/W2804969619","https://openalex.org/W4301100693","https://openalex.org/W2057124519","https://openalex.org/W2133859997","https://openalex.org/W2187700168","https://openalex.org/W2296729072","https://openalex.org/W2007607373"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,40],"consider":[4],"the":[5,44,71,113],"maximum":[6,18,72,109],"independent":[7,21,73,98,110],"set":[8,19,74,99],"problem":[9,31,75],"in":[10,26,93,104],"which":[11],"one":[12],"would":[13],"like":[14],"to":[15,43],"find":[16],"a":[17,27,66,80,108],"of":[20,46,88,118],"(i.e.,":[22],"pairwise":[23],"nonadjacent)":[24],"vertices":[25],"given":[28,81],"graph.":[29],"The":[30],"is":[32,101,121],"NP-complete,":[33],"and":[34],"still":[35],"remains":[36],"so":[37],"even":[38],"if":[39],"restrict":[41],"ourselves":[42],"class":[45],"planar":[47,77,82],"graphs.":[48,78],"It":[49],"has":[50],"been":[51],"conjectured":[52],"that":[53,100],"there":[54],"exist":[55],"no":[56],"polynomial-time":[57,67],"exact":[58],"algorithms":[59],"for":[60,70],"any":[61,85],"NP-complete":[62],"problems.":[63],"We":[64],"present":[65],"approximation":[68],"algorithm":[69,91,120],"on":[76],"For":[79],"graph":[83],"having":[84],"number":[86],"n":[87],"vertices,":[89],"our":[90,119],"finds,":[92],"$O(n\\log":[94],"n)$":[95],"time,":[96],"an":[97],"necessarily":[102],"larger":[103],"size":[105],"than":[106,123],"half":[107],"set.":[111],"Thus":[112],"absolute":[114],"worst":[115],"case":[116],"ratio":[117],"greater":[122],"$\\tfrac{1}{2}$.":[124]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}