Harmless sets in sparse classes
Drange, P.G. and Muzi, I. and Reidl, Felix (2022) Harmless sets in sparse classes. Lecture Notes in Computer Science 13270 , pp. 299-312. ISSN 0302-9743.
|
Text
50230.pdf - First Submitted (AKA Pre-print) Download (587kB) | Preview |
Official URL: https://doi.org/10.1007/978-3-031-06678-8_22
Abstract
In the classic Target Set Selection problem, we are asked to minimise 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 [Discrete Optimization, 14:170–182, 2014] 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.
Metadata
| Item Type: | Article |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Felix Reidl |
| Date Deposited: | 15 Dec 2022 07:01 |
| Last Modified: | 09 Aug 2023 12:54 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/50230 |
Statistics
Downloads
Activity Overview
6 month trend
6 month trend
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
 |
Edit/View Item |