{"id":"https://openalex.org/W2276044171","doi":"https://doi.org/10.1142/s1793830916500191","title":"The 0\u20131 inverse maximum independent set problem on forests and unicyclic graphs","display_name":"The 0\u20131 inverse maximum independent set problem on forests and unicyclic graphs","publication_year":2016,"publication_date":"2016-01-14","ids":{"openalex":"https://openalex.org/W2276044171","doi":"https://doi.org/10.1142/s1793830916500191","mag":"2276044171"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830916500191","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830916500191","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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/A5012705888","display_name":"Shuaifu Liu","orcid":null},"institutions":[{"id":"https://openalex.org/I96908189","display_name":"Xinjiang University","ror":"https://ror.org/059gw8r13","country_code":"CN","type":"education","lineage":["https://openalex.org/I96908189"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shuaifu Liu","raw_affiliation_strings":["College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, P. R. China","institution_ids":["https://openalex.org/I96908189"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100423055","display_name":"Zhao Zhang","orcid":"https://orcid.org/0000-0003-4191-7598"},"institutions":[{"id":"https://openalex.org/I135237710","display_name":"Zhejiang Normal University","ror":"https://ror.org/01vevwk45","country_code":"CN","type":"education","lineage":["https://openalex.org/I135237710"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhao Zhang","raw_affiliation_strings":["College of Mathematics Physics and Information Engineering, Zhejiang Normal University, Jinhua, Zhejiang 321004, P. R. China"],"raw_orcid":"https://orcid.org/0000-0003-4191-7598","affiliations":[{"raw_affiliation_string":"College of Mathematics Physics and Information Engineering, Zhejiang Normal University, Jinhua, Zhejiang 321004, P. R. China","institution_ids":["https://openalex.org/I135237710"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.01850438,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"08","issue":"02","first_page":"1650019","last_page":"1650019"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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.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/T12288","display_name":"Optimization and Search Problems","score":0.9919999837875366,"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/mathematics","display_name":"Mathematics","score":0.8061676025390625},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7625342607498169},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.627124011516571},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.6137607097625732},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5918117165565491},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5033637881278992},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.4862045645713806},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46674662828445435},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4509722888469696},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4055296778678894},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.2423684298992157},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.14709249138832092},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08714672923088074},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.08003532886505127}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8061676025390625},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7625342607498169},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.627124011516571},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.6137607097625732},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5918117165565491},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5033637881278992},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.4862045645713806},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46674662828445435},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4509722888469696},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4055296778678894},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2423684298992157},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.14709249138832092},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08714672923088074},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.08003532886505127},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830916500191","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830916500191","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Life in Land","score":0.7400000095367432,"id":"https://metadata.un.org/sdg/15"}],"awards":[{"id":"https://openalex.org/G1448350847","display_name":null,"funder_award_id":"11531011","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G7031241050","display_name":null,"funder_award_id":"61222201","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G7530012965","display_name":null,"funder_award_id":"20126501110001","funder_id":"https://openalex.org/F4320336024","funder_display_name":"Specialized Research Fund for the Doctoral Program of Higher Education of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320336024","display_name":"Specialized Research Fund for the Doctoral Program of Higher Education of China","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1507183619","https://openalex.org/W1966229055","https://openalex.org/W1979134936","https://openalex.org/W2003303695","https://openalex.org/W2005142437","https://openalex.org/W2011039300","https://openalex.org/W2154020126","https://openalex.org/W2160736482"],"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":{"Given":[0],"a":[1,41,65],"graph":[2],"[Formula:":[3,10,14,37,46],"see":[4,11,15,25,38,47,54,77],"text]":[5,12,39,55,78],"and":[6,81],"an":[7],"independent":[8,21,43,62],"set":[9,22,44,63],"of":[13,45],"text],":[16],"the":[17,60],"0\u20131":[18],"inverse":[19],"maximum":[20,42],"problem":[23],"(IMIS[Formula:":[24],"text])":[26],"is":[27,50,56],"to":[28],"delete":[29],"as":[30,33],"few":[31],"vertices":[32],"possible":[34],"such":[35],"that":[36,52],"becomes":[40],"text].":[48],"It":[49],"known":[51],"IMIS[Formula:":[53,76],"NP-hard":[57],"even":[58],"when":[59],"given":[61],"has":[64],"bounded":[66],"size.":[67],"In":[68],"this":[69],"paper,":[70],"we":[71],"present":[72],"linear-time":[73],"algorithms":[74],"for":[75],"on":[79],"forests":[80],"unicyclic":[82],"graphs.":[83]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}