{"id":"https://openalex.org/W2181288515","doi":"https://doi.org/10.1007/978-3-642-19222-7_17","title":"Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures","display_name":"Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2181288515","doi":"https://doi.org/10.1007/978-3-642-19222-7_17","mag":"2181288515"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-19222-7_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-19222-7_17","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":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://basepub.dauphine.fr/handle/123456789/6059","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002493273","display_name":"Cristina Bazgan","orcid":"https://orcid.org/0000-0002-5460-6222"},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Cristina Bazgan","raw_affiliation_strings":["LAMSADE, Universit\u00e9 Paris-Dauphine, France"],"affiliations":[{"raw_affiliation_string":"LAMSADE, Universit\u00e9 Paris-Dauphine, France","institution_ids":["https://openalex.org/I56435720"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085699706","display_name":"Sonia Toubaline","orcid":null},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Sonia Toubaline","raw_affiliation_strings":["LAMSADE, Universit\u00e9 Paris-Dauphine, France"],"affiliations":[{"raw_affiliation_string":"LAMSADE, Universit\u00e9 Paris-Dauphine, France","institution_ids":["https://openalex.org/I56435720"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026437192","display_name":"\u0179solt Tuza","orcid":"https://orcid.org/0000-0003-3235-9221"},"institutions":[{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"funder","lineage":["https://openalex.org/I7597260"]},{"id":"https://openalex.org/I4210127496","display_name":"Veszpr\u00e9mi \u00c9rseki Hittudom\u00e1nyi F\u00f5iskola","ror":"https://ror.org/03js41c71","country_code":"HU","type":"education","lineage":["https://openalex.org/I4210127496"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Zsolt Tuza","raw_affiliation_strings":["Computer and Automation Institute, Hungarian Academy of Sciences, Budapest, Hungary","Department of Computer Science and Systems Technology, University of Veszpr\u00e9m, Hungary"],"affiliations":[{"raw_affiliation_string":"Computer and Automation Institute, Hungarian Academy of Sciences, Budapest, Hungary","institution_ids":["https://openalex.org/I7597260"]},{"raw_affiliation_string":"Department of Computer Science and Systems Technology, University of Veszpr\u00e9m, Hungary","institution_ids":["https://openalex.org/I4210127496"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002493273"],"corresponding_institution_ids":["https://openalex.org/I56435720"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.156,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.79756767,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"154","last_page":"166"},"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.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/T12288","display_name":"Optimization and Search Problems","score":0.9955000281333923,"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/combinatorics","display_name":"Combinatorics","score":0.7905058860778809},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7328372597694397},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.6700434684753418},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6539371013641357},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.6435714960098267},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5908665657043457},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5419673323631287},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4979276657104492},{"id":"https://openalex.org/keywords/metric-dimension","display_name":"Metric dimension","score":0.49017176032066345},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.47939252853393555},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4617360830307007},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4413444995880127},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4295034408569336},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36865273118019104},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.2881043553352356},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15134981274604797}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7905058860778809},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7328372597694397},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.6700434684753418},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6539371013641357},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.6435714960098267},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5908665657043457},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5419673323631287},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4979276657104492},{"id":"https://openalex.org/C60933471","wikidata":"https://www.wikidata.org/wiki/Q17152964","display_name":"Metric dimension","level":5,"score":0.49017176032066345},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.47939252853393555},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4617360830307007},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4413444995880127},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4295034408569336},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36865273118019104},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.2881043553352356},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15134981274604797},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-642-19222-7_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-19222-7_17","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"},{"id":"pmh:oai:basepub.dauphine.fr:123456789/6059","is_oa":true,"landing_page_url":"https://basepub.dauphine.fr/handle/123456789/6059","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication / Conf\u00e9rence"},{"id":"pmh:oai:eprints.sztaki.hu:6594","is_oa":false,"landing_page_url":"http://eprints.sztaki.hu/6594/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401907","display_name":"SZTAKI Publication Repository (Hungarian Academy of Sciences)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I7597260","host_organization_name":"Hungarian Academy of Sciences","host_organization_lineage":["https://openalex.org/I7597260"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:1326441","is_oa":false,"landing_page_url":"http://discovery.ucl.ac.uk/1326441/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"     In: Iliopoulos, CS and Smyth, WF, (eds.) COMBINATORIAL ALGORITHMS.  (pp. 154 - 166).  SPRINGER-VERLAG BERLIN (2011)     ","raw_type":"Proceedings paper"}],"best_oa_location":{"id":"pmh:oai:basepub.dauphine.fr:123456789/6059","is_oa":true,"landing_page_url":"https://basepub.dauphine.fr/handle/123456789/6059","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication / Conf\u00e9rence"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W143512583","https://openalex.org/W1597075609","https://openalex.org/W2013415302","https://openalex.org/W2015906942","https://openalex.org/W2038225707","https://openalex.org/W2038483792","https://openalex.org/W2059372025","https://openalex.org/W2067622223","https://openalex.org/W2076304834","https://openalex.org/W2076631145","https://openalex.org/W2121815516","https://openalex.org/W2130626677","https://openalex.org/W2133494553","https://openalex.org/W2139610344","https://openalex.org/W2171760878","https://openalex.org/W3161056635","https://openalex.org/W4213368513"],"related_works":["https://openalex.org/W1539278744","https://openalex.org/W2091382007","https://openalex.org/W3131586115","https://openalex.org/W3214912338","https://openalex.org/W2952768305","https://openalex.org/W2962682232","https://openalex.org/W2203654255","https://openalex.org/W4225972719","https://openalex.org/W3212051020","https://openalex.org/W2898526288"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}