Stability of vertex covers in a game with finitely many steps
From MaRDI portal
Publication:6648352
DOI10.33048/DAIO.2024.31.797MaRDI QIDQ6648352FDOQ6648352
Authors: V. L. Beresnev, Andrey Melnikov, S. Yu. Utyupin
Publication date: 4 December 2024
Published in: Diskretnyĭ Analiz i Issledovanie Operatsiĭ (Search for Journal in Brave)
Recommendations
- Representation of the eternal vertex cover problem as a dynamic Stackelberg game
- Some algorithmic results for eternal vertex cover problem in graphs
- On graphs with minimal eternal vertex cover number
- On graphs whose eternal vertex cover number and vertex cover number coincide
- An eternal vertex cover problem
2-person games (91A05) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)
Cites Work
- Julia: a fresh approach to numerical computing
- Protecting a graph with mobile guards
- Edge protection in graphs
- Eternal vertex cover on bipartite graphs
- Some algorithmic results for eternal vertex cover problem in graphs
- Parameterized algorithm for eternal vertex cover
- A substructure based lower bound for eternal vertex cover number
- A new lower bound for the eternal vertex cover number of graphs
- Representation of the eternal vertex cover problem as a dynamic Stackelberg game
Cited In (2)
This page was built for publication: Stability of vertex covers in a game with finitely many steps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6648352)