{"id":"https://openalex.org/W2161359621","doi":"https://doi.org/10.1109/dmo.2009.5341909","title":"A note on the P-time algorithms for solving the maximum independent set problem","display_name":"A note on the P-time algorithms for solving the maximum independent set problem","publication_year":2009,"publication_date":"2009-10-01","ids":{"openalex":"https://openalex.org/W2161359621","doi":"https://doi.org/10.1109/dmo.2009.5341909","mag":"2161359621"},"language":"en","primary_location":{"id":"doi:10.1109/dmo.2009.5341909","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dmo.2009.5341909","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 2nd Conference on Data Mining and Optimization","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/A5040870755","display_name":"Navid Nasr Esfahani","orcid":"https://orcid.org/0000-0001-8146-3450"},"institutions":[{"id":"https://openalex.org/I170013655","display_name":"Isfahan University of Technology","ror":"https://ror.org/00af3sa43","country_code":"IR","type":"education","lineage":["https://openalex.org/I170013655"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Navid Nasr Esfahani","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran","institution_ids":["https://openalex.org/I170013655"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001768116","display_name":"Parisa Mazrooei","orcid":null},"institutions":[{"id":"https://openalex.org/I170013655","display_name":"Isfahan University of Technology","ror":"https://ror.org/00af3sa43","country_code":"IR","type":"education","lineage":["https://openalex.org/I170013655"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Parisa Mazrooei","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran","institution_ids":["https://openalex.org/I170013655"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049773632","display_name":"Kaveh Mahdaviani","orcid":"https://orcid.org/0000-0001-5119-0586"},"institutions":[{"id":"https://openalex.org/I170013655","display_name":"Isfahan University of Technology","ror":"https://ror.org/00af3sa43","country_code":"IR","type":"education","lineage":["https://openalex.org/I170013655"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Kaveh Mahdaviani","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran","institution_ids":["https://openalex.org/I170013655"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021191760","display_name":"Behnaz Omoomi","orcid":null},"institutions":[{"id":"https://openalex.org/I170013655","display_name":"Isfahan University of Technology","ror":"https://ror.org/00af3sa43","country_code":"IR","type":"education","lineage":["https://openalex.org/I170013655"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Behnaz Omoomi","raw_affiliation_strings":["Department of Mathematical Science, Isfahan University of Technology, Isfahan, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Science, Isfahan University of Technology, Isfahan, Iran","institution_ids":["https://openalex.org/I170013655"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.18626886,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"379","issue":null,"first_page":"65","last_page":"70"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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.9994000196456909,"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.9991000294685364,"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/time-complexity","display_name":"Time complexity","score":0.6656954288482666},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.6357473134994507},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5652265548706055},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5236563086509705},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5198360085487366},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5149713158607483},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5056724548339844},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.49353134632110596},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4836050570011139},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.47387146949768066},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42350298166275024},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.42038023471832275},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3851029574871063},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38100025057792664},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.2878982126712799},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.19217753410339355},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10829636454582214},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.07281792163848877}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6656954288482666},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.6357473134994507},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5652265548706055},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5236563086509705},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5198360085487366},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5149713158607483},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5056724548339844},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.49353134632110596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4836050570011139},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.47387146949768066},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42350298166275024},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.42038023471832275},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3851029574871063},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38100025057792664},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2878982126712799},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.19217753410339355},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10829636454582214},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.07281792163848877},{"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/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.1109/dmo.2009.5341909","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dmo.2009.5341909","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 2nd Conference on Data Mining and Optimization","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W646088219","https://openalex.org/W1479863711","https://openalex.org/W1480459784","https://openalex.org/W1582786162","https://openalex.org/W1587128046","https://openalex.org/W1963707128","https://openalex.org/W2001258629","https://openalex.org/W2015564725","https://openalex.org/W2087083200","https://openalex.org/W2100432797","https://openalex.org/W2152024671","https://openalex.org/W2172358501","https://openalex.org/W3141776272","https://openalex.org/W3148190347","https://openalex.org/W6991506992"],"related_works":["https://openalex.org/W2048358792","https://openalex.org/W2620541949","https://openalex.org/W2187700168","https://openalex.org/W2296729072","https://openalex.org/W1972853793","https://openalex.org/W2399100966","https://openalex.org/W1903284337","https://openalex.org/W1856729396","https://openalex.org/W2009846993","https://openalex.org/W2789268215"],"abstract_inverted_index":{"In":[0],"this":[1,18,100],"article,":[2],"the":[3,22,36,57,87,96],"problem":[4,19,38,59,89],"of":[5,24,43,54,77,95],"finding":[6],"maximum":[7],"(weight)":[8],"independent":[9],"set":[10],"(M(W)IS)":[11],"is":[12,15,60,103],"investigated.":[13],"It":[14],"known":[16],"that":[17,56],"belongs":[20],"to":[21,34,85],"class":[23,76,97],"NP-hard":[25],"problems.":[26],"Although,":[27],"there":[28],"are":[29],"polynomial":[30],"time":[31],"(P-time)":[32],"algorithms":[33],"solve":[35,86],"M(W)IS":[37,58,88],"for":[39,62,74,90],"some":[40],"special":[41],"classes":[42,55],"graphs.":[44],"Here,":[45],"we":[46],"propose":[47],"a":[48,75,81],"general":[49,67],"scheme":[50],"which":[51],"extends":[52],"all":[53],"solvable":[61],"them":[63],"in":[64,92],"P-time.":[65],"This":[66],"scheme,":[68],"based":[69],"on":[70],"any":[71],"P-time":[72,83],"algorithm":[73,84,102],"graphs":[78,91],"C,":[79],"generates":[80],"new":[82,101],"an":[93],"extension":[94],"C.":[98],"Moreover,":[99],"robust.":[104]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}