arXiv (All)
open access
Structural Parameterizations for Eternal Vertex Cover
05c5705c85combinatoricscomputational-complexitydata-structures-and-algorithmsdiscrete-mathematicsg-2-2
Eternal Vertex Cover (EVC) is a turn-based attacker-defender game on an undirected graph $G$. To begin with, the defender places $k$ guards on vertices of $G$. The attacker, on their turn, can choose an edge $e$ not already occupied at both endpoints to "attack". The edge $e$ is defended if a guard
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- CSC: Turning the Adversary's Poison against Itself#128217
- DARWIN: Evolving Jailbreak Adversary and Guardrail for LLM Safety Evaluation and Protection#1130594
- On a problem concerning $\mathbb Z_3$-Ramsey numbers#1064332
- The forbidden structure for zero forcing number#784747
- The forbidden structure for zero forcing number#783157
Record · ID 1011606
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive