Eternal vertex cover problem is a graph protection problem which is a dynamic two player game variant of the classical vertex cover problem. In this game, the minimum number of guards required to protect a graph $G$ is called the eternal vertex cover number of $G$, denoted by $evc(G)$.
Cipriyano Simoes
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
Get in touch with Cipriyano
Contact Cipriyano, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack