{"id":"https://openalex.org/W2097844290","doi":"https://doi.org/10.1137/0206038","title":"Finding a Maximum Independent Set","display_name":"Finding a Maximum Independent Set","publication_year":1977,"publication_date":"1977-09-01","ids":{"openalex":"https://openalex.org/W2097844290","doi":"https://doi.org/10.1137/0206038","mag":"2097844290"},"language":"en","primary_location":{"id":"doi:10.1137/0206038","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206038","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/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Robert Endre Tarjan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5047292190","display_name":"Anthony E. Trojanowski","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anthony E. Trojanowski","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051027549"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2869,"has_fulltext":false,"cited_by_count":474,"citation_normalized_percentile":{"value":0.81073512,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"6","issue":"3","first_page":"537","last_page":"546"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987999796867371,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.6466842293739319},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.6395553350448608},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5914003849029541},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5552098751068115},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46806445717811584},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45337507128715515},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45180854201316833},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43810519576072693},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.4204578399658203},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3943555951118469},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.2136717140674591},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.1315118372440338}],"concepts":[{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.6466842293739319},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.6395553350448608},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5914003849029541},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5552098751068115},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46806445717811584},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45337507128715515},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45180854201316833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43810519576072693},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.4204578399658203},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3943555951118469},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2136717140674591},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.1315118372440338},{"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.1137/0206038","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206038","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1975442866","https://openalex.org/W1979412257","https://openalex.org/W2004639699","https://openalex.org/W2013415302","https://openalex.org/W2036265926","https://openalex.org/W2045492613","https://openalex.org/W2076092592","https://openalex.org/W2101405134","https://openalex.org/W2116007667","https://openalex.org/W2401610261","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W300018836","https://openalex.org/W3037291746","https://openalex.org/W3164644441","https://openalex.org/W2906881967","https://openalex.org/W2935770235","https://openalex.org/W2991587872","https://openalex.org/W3004945501","https://openalex.org/W3118753906","https://openalex.org/W2561239406","https://openalex.org/W2907170473"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2,11],"algorithm":[3,18],"which":[4],"finds":[5],"a":[6,33],"maximum":[7],"independent":[8],"set":[9],"in":[10,14],"n-vertex":[12],"graph":[13],"$O(2^{n/3})$":[15],"time.":[16],"The":[17],"can":[19],"thus":[20],"handle":[21],"graphs":[22],"roughly":[23],"three":[24],"times":[25],"as":[26,28],"large":[27],"could":[29],"be":[30],"analyzed":[31],"using":[32],"naive":[34],"algorithm.":[35]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":14},{"year":2024,"cited_by_count":13},{"year":2023,"cited_by_count":19},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":20},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":15},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":21},{"year":2013,"cited_by_count":24},{"year":2012,"cited_by_count":12}],"updated_date":"2026-04-23T09:07:50.710637","created_date":"2025-10-10T00:00:00"}