{"id":"https://openalex.org/W1549137733","doi":"https://doi.org/10.1007/11682462_46","title":"A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs","display_name":"A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1549137733","doi":"https://doi.org/10.1007/11682462_46","mag":"1549137733"},"language":"en","primary_location":{"id":"doi:10.1007/11682462_46","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11682462_46","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5052643589","display_name":"Martin F\u00fcrer","orcid":"https://orcid.org/0000-0001-5354-3226"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Martin F\u00fcrer","raw_affiliation_strings":["Pennsylvania State University, University Park, PA, 16802, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Pennsylvania State University, University Park, PA, 16802, USA","institution_ids":["https://openalex.org/I130769515"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5052643589"],"corresponding_institution_ids":["https://openalex.org/I130769515"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.2383,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.92060894,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"491","last_page":"501"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9990000128746033,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.670830249786377},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5789457559585571},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5552030205726624},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5151973366737366},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4873374402523041},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.43384724855422974},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4235118329524994},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.42096033692359924},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32826125621795654},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30836760997772217},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16057929396629333},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.15211006999015808},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.05760997533798218}],"concepts":[{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.670830249786377},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5789457559585571},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5552030205726624},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5151973366737366},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4873374402523041},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.43384724855422974},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4235118329524994},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.42096033692359924},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32826125621795654},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30836760997772217},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16057929396629333},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.15211006999015808},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.05760997533798218},{"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/11682462_46","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11682462_46","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1513944945","https://openalex.org/W1971756951","https://openalex.org/W2027049731","https://openalex.org/W2073025989","https://openalex.org/W2097844290","https://openalex.org/W2139364539"],"related_works":["https://openalex.org/W2103112216","https://openalex.org/W1963654174","https://openalex.org/W2804969619","https://openalex.org/W2057124519","https://openalex.org/W4301100693","https://openalex.org/W3030122542","https://openalex.org/W2133859997","https://openalex.org/W2977583296","https://openalex.org/W3021108537","https://openalex.org/W2905396358"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}