{"id":"https://openalex.org/W2088500299","doi":"https://doi.org/10.1080/00207169108803967","title":"An algorithm for finding a maximum weighted independent set in an arbitrary graph","display_name":"An algorithm for finding a maximum weighted independent set in an arbitrary graph","publication_year":1991,"publication_date":"1991-01-01","ids":{"openalex":"https://openalex.org/W2088500299","doi":"https://doi.org/10.1080/00207169108803967","mag":"2088500299"},"language":"en","primary_location":{"id":"doi:10.1080/00207169108803967","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169108803967","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5050062467","display_name":"P\u00e3nos M. Pardalos","orcid":"https://orcid.org/0000-0001-9623-8053"},"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":"Panos M. Pardalos","raw_affiliation_strings":["Computer Science Department , The Pennsylvania State University , University Park, PA, 16802, USA","Computer Science Department, The Pennsylvania State University, University Park, PA, 16802, USA","Computer Science Department, The Pennsylvania State University University Park, PA 16802, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department , The Pennsylvania State University , University Park, PA, 16802, USA","institution_ids":["https://openalex.org/I130769515"]},{"raw_affiliation_string":"Computer Science Department, The Pennsylvania State University, University Park, PA, 16802, USA","institution_ids":["https://openalex.org/I130769515"]},{"raw_affiliation_string":"Computer Science Department, The Pennsylvania State University University Park, PA 16802, USA","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009911595","display_name":"Nisha Desai","orcid":null},"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":false,"raw_author_name":"Nisha Desai","raw_affiliation_strings":["Computer Science Department , The Pennsylvania State University , University Park, PA, 16802, USA","Computer Science Department, The Pennsylvania State University, University Park, PA, 16802, USA","Computer Science Department, The Pennsylvania State University University Park, PA 16802, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department , The Pennsylvania State University , University Park, PA, 16802, USA","institution_ids":["https://openalex.org/I130769515"]},{"raw_affiliation_string":"Computer Science Department, The Pennsylvania State University, University Park, PA, 16802, USA","institution_ids":["https://openalex.org/I130769515"]},{"raw_affiliation_string":"Computer Science Department, The Pennsylvania State University University Park, PA 16802, USA","institution_ids":["https://openalex.org/I130769515"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050062467"],"corresponding_institution_ids":["https://openalex.org/I130769515"],"apc_list":null,"apc_paid":null,"fwci":3.592,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.93900278,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"38","issue":"3-4","first_page":"163","last_page":"175"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.998199999332428,"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.998199999332428,"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/T11106","display_name":"Data Management and Algorithms","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9966999888420105,"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/heuristics","display_name":"Heuristics","score":0.7570087909698486},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7007328271865845},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6505632996559143},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.6269029378890991},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6086992025375366},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5448681116104126},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5347729325294495},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4989330768585205},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.47787991166114807},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4403465688228607},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40324437618255615},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34366369247436523},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23638471961021423}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7570087909698486},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7007328271865845},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6505632996559143},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.6269029378890991},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6086992025375366},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5448681116104126},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5347729325294495},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4989330768585205},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.47787991166114807},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4403465688228607},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40324437618255615},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34366369247436523},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23638471961021423},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207169108803967","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169108803967","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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":20,"referenced_works":["https://openalex.org/W25288802","https://openalex.org/W47629461","https://openalex.org/W1501516191","https://openalex.org/W2011039300","https://openalex.org/W2020567423","https://openalex.org/W2026320281","https://openalex.org/W2035758901","https://openalex.org/W2037982899","https://openalex.org/W2041210844","https://openalex.org/W2043005464","https://openalex.org/W2048440507","https://openalex.org/W2052850644","https://openalex.org/W2068244470","https://openalex.org/W2071702553","https://openalex.org/W2089417393","https://openalex.org/W2097844290","https://openalex.org/W2100440346","https://openalex.org/W2116007667","https://openalex.org/W2162164123","https://openalex.org/W3165743976"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W3119129187","https://openalex.org/W2013650843"],"abstract_inverted_index":{"We":[0,50],"propose":[1],"and":[2,21,23,32,41],"implement":[3],"an":[4,16],"exact":[5],"algorithm":[6],"for":[7],"the":[8],"maximum":[9],"weighted":[10],"independent":[11],"set":[12],"problem":[13],"based":[14],"on":[15],"unconstrained":[17],"quadratic":[18],"0\u20131":[19],"formulation":[20],"branch":[22,31],"bound":[24,33],"techniques.":[25],"The":[26],"use":[27],"of":[28],"a":[29],"non-greedy":[30],"method":[34],"using":[35,55],"depth":[36],"first":[37],"search":[38],"is":[39],"presented":[40],"justified":[42],"along":[43],"with":[44,59],"various":[45],"heuristics":[46],"to":[47,61],"improve":[48],"performance.":[49],"also":[51],"present":[52],"computational":[53],"results":[54],"randomly":[56],"generated":[57],"graphs":[58],"up":[60],"500":[62],"vertices.":[63]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-23T09:07:50.710637","created_date":"2025-10-10T00:00:00"}