Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Arko Sharma"'
Publikováno v:
Theoretical Computer Science. 890:87-104
The eternal vertex cover (EVC) problem is to compute the minimum number of guards to be placed on the vertices of a graph so that any sequence of attacks on its edges can be defended by dynamically reconfiguring the guards. The problem is NP-hard in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f363759808cb061467511e0a0ee6cbca
https://doi.org/10.1016/j.tcs.2021.08.018
https://doi.org/10.1016/j.tcs.2021.08.018
