| dc.creator | Rinemberg, Martín | |
| dc.creator | Soulignac, Francisco Juan | |
| dc.date.accessioned | 2021-04-19T04:23:07Z | |
| dc.date.accessioned | 2022-10-15T03:08:20Z | |
| dc.date.available | 2021-04-19T04:23:07Z | |
| dc.date.available | 2022-10-15T03:08:20Z | |
| dc.date.created | 2021-04-19T04:23:07Z | |
| dc.date.issued | 2019-06 | |
| dc.identifier | Rinemberg, Martín; Soulignac, Francisco Juan; The eternal dominating set problem for interval graphs; Elsevier Science; Information Processing Letters; 146; 6-2019; 27-29 | |
| dc.identifier | 0020-0190 | |
| dc.identifier | http://hdl.handle.net/11336/130290 | |
| dc.identifier | CONICET Digital | |
| dc.identifier | CONICET | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/4338366 | |
| dc.description.abstract | We prove that, in games in which all the guards move at the same turn, the eternal domination and the clique-connected cover numbers coincide for interval graphs. A linear algorithm for the eternal dominating set problem on interval graphs is obtained as a by-product. | |
| dc.language | eng | |
| dc.publisher | Elsevier Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1016/j.ipl.2019.01.013 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/abs/pii/S0020019019300213 | |
| dc.rights | https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | |
| dc.rights | info:eu-repo/semantics/restrictedAccess | |
| dc.subject | COMBINATORIAL PROBLEMS | |
| dc.subject | ETERNAL DOMINATING SET | |
| dc.subject | INTERVAL GRAPHS | |
| dc.subject | NEOCOLONIZATION | |
| dc.title | The eternal dominating set problem for interval graphs | |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:ar-repo/semantics/artículo | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
