Kernelization and hardness of harmless sets in sparse classes Article Swipe
In the classic TARGET SET SELECTION problem, we are asked to minimize the number of nodes to activate so that, after the application of a certain propagation process, all nodes of the graph are active. Bazgan and Chopin introduced the opposite problem, named HARMLESS SET, in which they ask to maximise the number of nodes to activate such that not a single additional node is activated. In this paper we investigate how sparsity impacts the tractability of HARMLESS SET. Specifically, we answer two open questions posed by the aforementioned authors, namely a) whether the problem is FPT on planar graphs and b) whether it is FTP parameterised by treewidth. The first question can be answered in the positive using existing meta-theorems on sparse classes, and we further show that HARMLESS SET even admits a polynomial kernel. We then answer the second question in the negative by showing that the problem is W[1]-hard when parametrised by a parameter that upper bounds treewidth.
Related Topics
Concepts
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/pdf/2111.11834.pdf
- OA Status
- green
- Cited By
- 1
- References
- 24
- OpenAlex ID
- https://openalex.org/W3216561999
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W3216561999Canonical identifier for this work in OpenAlex
- Title
-
Kernelization and hardness of harmless sets in sparse classesWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2021Year of publication
- Publication date
-
2021-11-23Full publication date if available
- Authors
-
Pål Grønås Drange, Irene Muzi, Felix ReidlList of authors in order
- Landing page
-
https://arxiv.org/pdf/2111.11834.pdfPublisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/2111.11834.pdfDirect OA link when available
- Concepts
-
Kernelization, Treewidth, Independent set, Set (abstract data type), Combinatorics, Graph, Computer science, Mathematics, Selection (genetic algorithm), Theoretical computer science, Parameterized complexity, Discrete mathematics, Pathwidth, Artificial intelligence, Line graph, Programming languageTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
1Total citation count in OpenAlex
- Citations by year (recent)
-
2023: 1Per-year citation counts (last 5 years)
- References (count)
-
24Number of works referenced by this work
Full payload
| id | https://openalex.org/W3216561999 |
|---|---|
| doi | |
| ids.mag | 3216561999 |
| ids.openalex | https://openalex.org/W3216561999 |
| fwci | |
| type | preprint |
| title | Kernelization and hardness of harmless sets in sparse classes |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10374 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9998999834060669 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1703 |
| topics[0].subfield.display_name | Computational Theory and Mathematics |
| topics[0].display_name | Advanced Graph Theory Research |
| topics[1].id | https://openalex.org/T10720 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9998000264167786 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1703 |
| topics[1].subfield.display_name | Computational Theory and Mathematics |
| topics[1].display_name | Complexity and Algorithms in Graphs |
| topics[2].id | https://openalex.org/T11329 |
| topics[2].field.id | https://openalex.org/fields/26 |
| topics[2].field.display_name | Mathematics |
| topics[2].score | 0.9968000054359436 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2607 |
| topics[2].subfield.display_name | Discrete Mathematics and Combinatorics |
| topics[2].display_name | Limits and Structures in Graph Theory |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C207225210 |
| concepts[0].level | 3 |
| concepts[0].score | 0.8489624261856079 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q1759539 |
| concepts[0].display_name | Kernelization |
| concepts[1].id | https://openalex.org/C132569581 |
| concepts[1].level | 5 |
| concepts[1].score | 0.7780202627182007 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q5067368 |
| concepts[1].display_name | Treewidth |
| concepts[2].id | https://openalex.org/C122818955 |
| concepts[2].level | 3 |
| concepts[2].score | 0.5688644647598267 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q1060343 |
| concepts[2].display_name | Independent set |
| concepts[3].id | https://openalex.org/C177264268 |
| concepts[3].level | 2 |
| concepts[3].score | 0.556159257888794 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q1514741 |
| concepts[3].display_name | Set (abstract data type) |
| concepts[4].id | https://openalex.org/C114614502 |
| concepts[4].level | 1 |
| concepts[4].score | 0.5513277053833008 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q76592 |
| concepts[4].display_name | Combinatorics |
| concepts[5].id | https://openalex.org/C132525143 |
| concepts[5].level | 2 |
| concepts[5].score | 0.49072396755218506 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q141488 |
| concepts[5].display_name | Graph |
| concepts[6].id | https://openalex.org/C41008148 |
| concepts[6].level | 0 |
| concepts[6].score | 0.4845398962497711 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[6].display_name | Computer science |
| concepts[7].id | https://openalex.org/C33923547 |
| concepts[7].level | 0 |
| concepts[7].score | 0.4528913199901581 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[7].display_name | Mathematics |
| concepts[8].id | https://openalex.org/C81917197 |
| concepts[8].level | 2 |
| concepts[8].score | 0.44915974140167236 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q628760 |
| concepts[8].display_name | Selection (genetic algorithm) |
| concepts[9].id | https://openalex.org/C80444323 |
| concepts[9].level | 1 |
| concepts[9].score | 0.44471314549446106 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q2878974 |
| concepts[9].display_name | Theoretical computer science |
| concepts[10].id | https://openalex.org/C165464430 |
| concepts[10].level | 2 |
| concepts[10].score | 0.4142789840698242 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q1570441 |
| concepts[10].display_name | Parameterized complexity |
| concepts[11].id | https://openalex.org/C118615104 |
| concepts[11].level | 1 |
| concepts[11].score | 0.40729355812072754 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q121416 |
| concepts[11].display_name | Discrete mathematics |
| concepts[12].id | https://openalex.org/C43517604 |
| concepts[12].level | 4 |
| concepts[12].score | 0.24776464700698853 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q7144893 |
| concepts[12].display_name | Pathwidth |
| concepts[13].id | https://openalex.org/C154945302 |
| concepts[13].level | 1 |
| concepts[13].score | 0.218348890542984 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[13].display_name | Artificial intelligence |
| concepts[14].id | https://openalex.org/C203776342 |
| concepts[14].level | 3 |
| concepts[14].score | 0.08873018622398376 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q1378376 |
| concepts[14].display_name | Line graph |
| concepts[15].id | https://openalex.org/C199360897 |
| concepts[15].level | 1 |
| concepts[15].score | 0.0 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q9143 |
| concepts[15].display_name | Programming language |
| keywords[0].id | https://openalex.org/keywords/kernelization |
| keywords[0].score | 0.8489624261856079 |
| keywords[0].display_name | Kernelization |
| keywords[1].id | https://openalex.org/keywords/treewidth |
| keywords[1].score | 0.7780202627182007 |
| keywords[1].display_name | Treewidth |
| keywords[2].id | https://openalex.org/keywords/independent-set |
| keywords[2].score | 0.5688644647598267 |
| keywords[2].display_name | Independent set |
| keywords[3].id | https://openalex.org/keywords/set |
| keywords[3].score | 0.556159257888794 |
| keywords[3].display_name | Set (abstract data type) |
| keywords[4].id | https://openalex.org/keywords/combinatorics |
| keywords[4].score | 0.5513277053833008 |
| keywords[4].display_name | Combinatorics |
| keywords[5].id | https://openalex.org/keywords/graph |
| keywords[5].score | 0.49072396755218506 |
| keywords[5].display_name | Graph |
| keywords[6].id | https://openalex.org/keywords/computer-science |
| keywords[6].score | 0.4845398962497711 |
| keywords[6].display_name | Computer science |
| keywords[7].id | https://openalex.org/keywords/mathematics |
| keywords[7].score | 0.4528913199901581 |
| keywords[7].display_name | Mathematics |
| keywords[8].id | https://openalex.org/keywords/selection |
| keywords[8].score | 0.44915974140167236 |
| keywords[8].display_name | Selection (genetic algorithm) |
| keywords[9].id | https://openalex.org/keywords/theoretical-computer-science |
| keywords[9].score | 0.44471314549446106 |
| keywords[9].display_name | Theoretical computer science |
| keywords[10].id | https://openalex.org/keywords/parameterized-complexity |
| keywords[10].score | 0.4142789840698242 |
| keywords[10].display_name | Parameterized complexity |
| keywords[11].id | https://openalex.org/keywords/discrete-mathematics |
| keywords[11].score | 0.40729355812072754 |
| keywords[11].display_name | Discrete mathematics |
| keywords[12].id | https://openalex.org/keywords/pathwidth |
| keywords[12].score | 0.24776464700698853 |
| keywords[12].display_name | Pathwidth |
| keywords[13].id | https://openalex.org/keywords/artificial-intelligence |
| keywords[13].score | 0.218348890542984 |
| keywords[13].display_name | Artificial intelligence |
| keywords[14].id | https://openalex.org/keywords/line-graph |
| keywords[14].score | 0.08873018622398376 |
| keywords[14].display_name | Line graph |
| language | en |
| locations[0].id | mag:3216561999 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | |
| locations[0].pdf_url | |
| locations[0].version | submittedVersion |
| locations[0].raw_type | |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | arXiv (Cornell University) |
| locations[0].landing_page_url | http://arxiv.org/pdf/2111.11834.pdf |
| authorships[0].author.id | https://openalex.org/A5064442594 |
| authorships[0].author.orcid | https://orcid.org/0000-0001-7228-6640 |
| authorships[0].author.display_name | Pål Grønås Drange |
| authorships[0].countries | NO |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I4432739 |
| authorships[0].affiliations[0].raw_affiliation_string | University Of Bergen; |
| authorships[0].institutions[0].id | https://openalex.org/I4432739 |
| authorships[0].institutions[0].ror | https://ror.org/03zga2b32 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I4432739 |
| authorships[0].institutions[0].country_code | NO |
| authorships[0].institutions[0].display_name | University of Bergen |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Pål Grønås Drange |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | University Of Bergen; |
| authorships[1].author.id | https://openalex.org/A5048273965 |
| authorships[1].author.orcid | https://orcid.org/0000-0003-2410-6523 |
| authorships[1].author.display_name | Irene Muzi |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Irene Muzi |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | https://openalex.org/A5049595624 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-2354-3003 |
| authorships[2].author.display_name | Felix Reidl |
| authorships[2].author_position | last |
| authorships[2].raw_author_name | Felix Reidl |
| authorships[2].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | http://arxiv.org/pdf/2111.11834.pdf |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Kernelization and hardness of harmless sets in sparse classes |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-10-10T17:16:08.811792 |
| primary_topic.id | https://openalex.org/T10374 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9998999834060669 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1703 |
| primary_topic.subfield.display_name | Computational Theory and Mathematics |
| primary_topic.display_name | Advanced Graph Theory Research |
| cited_by_count | 1 |
| counts_by_year[0].year | 2023 |
| counts_by_year[0].cited_by_count | 1 |
| locations_count | 1 |
| best_oa_location.id | mag:3216561999 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | |
| best_oa_location.pdf_url | |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | arXiv (Cornell University) |
| best_oa_location.landing_page_url | http://arxiv.org/pdf/2111.11834.pdf |
| primary_location.id | mag:3216561999 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | |
| primary_location.pdf_url | |
| primary_location.version | submittedVersion |
| primary_location.raw_type | |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | arXiv (Cornell University) |
| primary_location.landing_page_url | http://arxiv.org/pdf/2111.11834.pdf |
| publication_date | 2021-11-23 |
| publication_year | 2021 |
| referenced_works | https://openalex.org/W2396832258, https://openalex.org/W2061324666, https://openalex.org/W2114616381, https://openalex.org/W1978747958, https://openalex.org/W2963329454, https://openalex.org/W2143305437, https://openalex.org/W2056609785, https://openalex.org/W1567923358, https://openalex.org/W1995698352, https://openalex.org/W2099898495, https://openalex.org/W2008080404, https://openalex.org/W2000922801, https://openalex.org/W1562988890, https://openalex.org/W2108858998, https://openalex.org/W2963587624, https://openalex.org/W2313886575, https://openalex.org/W2061820396, https://openalex.org/W1654194294, https://openalex.org/W1980240005, https://openalex.org/W1996858528, https://openalex.org/W3113818812, https://openalex.org/W2963177880, https://openalex.org/W2058486861, https://openalex.org/W2042123098 |
| referenced_works_count | 24 |
| abstract_inverted_index.a | 24, 60, 133, 155 |
| abstract_inverted_index.In | 0 |
| abstract_inverted_index.a) | 91 |
| abstract_inverted_index.b) | 101 |
| abstract_inverted_index.be | 113 |
| abstract_inverted_index.by | 86, 107, 145, 154 |
| abstract_inverted_index.in | 45, 115, 142 |
| abstract_inverted_index.is | 64, 95, 104, 150 |
| abstract_inverted_index.it | 103 |
| abstract_inverted_index.of | 14, 23, 30, 53, 76 |
| abstract_inverted_index.on | 97, 121 |
| abstract_inverted_index.so | 18 |
| abstract_inverted_index.to | 10, 16, 49, 55 |
| abstract_inverted_index.we | 7, 69, 80, 125 |
| abstract_inverted_index.FPT | 96 |
| abstract_inverted_index.FTP | 105 |
| abstract_inverted_index.SET | 4, 130 |
| abstract_inverted_index.The | 109 |
| abstract_inverted_index.all | 28 |
| abstract_inverted_index.and | 36, 100, 124 |
| abstract_inverted_index.are | 8, 33 |
| abstract_inverted_index.ask | 48 |
| abstract_inverted_index.can | 112 |
| abstract_inverted_index.how | 71 |
| abstract_inverted_index.not | 59 |
| abstract_inverted_index.the | 1, 12, 21, 31, 39, 51, 74, 87, 93, 116, 139, 143, 148 |
| abstract_inverted_index.two | 82 |
| abstract_inverted_index. In | 66 |
| abstract_inverted_index. We | 136 |
| abstract_inverted_index.SET, | 44 |
| abstract_inverted_index.SET. | 78 |
| abstract_inverted_index.even | 131 |
| abstract_inverted_index.node | 63 |
| abstract_inverted_index.open | 83 |
| abstract_inverted_index.show | 127 |
| abstract_inverted_index.such | 57 |
| abstract_inverted_index.that | 58, 128, 147, 157 |
| abstract_inverted_index.then | 137 |
| abstract_inverted_index.they | 47 |
| abstract_inverted_index.this | 67 |
| abstract_inverted_index.when | 152 |
| abstract_inverted_index.after | 20 |
| abstract_inverted_index.asked | 9 |
| abstract_inverted_index.first | 110 |
| abstract_inverted_index.graph | 32 |
| abstract_inverted_index.named | 42 |
| abstract_inverted_index.nodes | 15, 29, 54 |
| abstract_inverted_index.paper | 68 |
| abstract_inverted_index.posed | 85 |
| abstract_inverted_index.that, | 19 |
| abstract_inverted_index.upper | 158 |
| abstract_inverted_index.using | 118 |
| abstract_inverted_index.which | 46 |
| abstract_inverted_index.Chopin | 37 |
| abstract_inverted_index.TARGET | 3 |
| abstract_inverted_index.admits | 132 |
| abstract_inverted_index.answer | 81, 138 |
| abstract_inverted_index.bounds | 159 |
| abstract_inverted_index.graphs | 99 |
| abstract_inverted_index.namely | 90 |
| abstract_inverted_index.number | 13, 52 |
| abstract_inverted_index.planar | 98 |
| abstract_inverted_index.second | 140 |
| abstract_inverted_index.single | 61 |
| abstract_inverted_index.sparse | 122 |
| abstract_inverted_index.active. | 34 |
| abstract_inverted_index.certain | 25 |
| abstract_inverted_index.classic | 2 |
| abstract_inverted_index.further | 126 |
| abstract_inverted_index.impacts | 73 |
| abstract_inverted_index.kernel. | 135 |
| abstract_inverted_index.problem | 94, 149 |
| abstract_inverted_index.showing | 146 |
| abstract_inverted_index.whether | 92, 102 |
| abstract_inverted_index. Bazgan | 35 |
| abstract_inverted_index.HARMLESS | 43, 77, 129 |
| abstract_inverted_index.activate | 17, 56 |
| abstract_inverted_index.answered | 114 |
| abstract_inverted_index.authors, | 89 |
| abstract_inverted_index.classes, | 123 |
| abstract_inverted_index.existing | 119 |
| abstract_inverted_index.maximise | 50 |
| abstract_inverted_index.minimize | 11 |
| abstract_inverted_index.negative | 144 |
| abstract_inverted_index.opposite | 40 |
| abstract_inverted_index.positive | 117 |
| abstract_inverted_index.problem, | 6, 41 |
| abstract_inverted_index.process, | 27 |
| abstract_inverted_index.question | 111, 141 |
| abstract_inverted_index.sparsity | 72 |
| abstract_inverted_index.SELECTION | 5 |
| abstract_inverted_index.W[1]-hard | 151 |
| abstract_inverted_index.parameter | 156 |
| abstract_inverted_index.questions | 84 |
| abstract_inverted_index.activated. | 65 |
| abstract_inverted_index.additional | 62 |
| abstract_inverted_index.introduced | 38 |
| abstract_inverted_index.polynomial | 134 |
| abstract_inverted_index.treewidth. | 108, 160 |
| abstract_inverted_index.application | 22 |
| abstract_inverted_index.investigate | 70 |
| abstract_inverted_index.propagation | 26 |
| abstract_inverted_index.parametrised | 153 |
| abstract_inverted_index.tractability | 75 |
| abstract_inverted_index.Specifically, | 79 |
| abstract_inverted_index.meta-theorems | 120 |
| abstract_inverted_index.parameterised | 106 |
| abstract_inverted_index.aforementioned | 88 |
| cited_by_percentile_year | |
| countries_distinct_count | 1 |
| institutions_distinct_count | 3 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/16 |
| sustainable_development_goals[0].score | 0.46000000834465027 |
| sustainable_development_goals[0].display_name | Peace, Justice and strong institutions |
| citation_normalized_percentile |