Stability of vertex covers in a game with finitely many steps

DOI10.33048/DAIO.2024.31.797MaRDI QIDQ6648352zbMATH OpenFDO

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)

zbMATH Keywords

eternal vertex coverdynamic Stackelberg gamegraph edge protectionstability check algorithm

Mathematics Subject Classification ID

2-person games (91A05) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

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

Cites work

• A new lower bound for the eternal vertex cover number of graphs
• A substructure based lower bound for eternal vertex cover number
• Edge protection in graphs
• Eternal vertex cover on bipartite graphs
• Julia: a fresh approach to numerical computing
• Parameterized algorithm for eternal vertex cover
• Protecting a graph with mobile guards
• Representation of the eternal vertex cover problem as a dynamic Stackelberg game
• Some algorithmic results for eternal vertex cover problem in graphs

Cited in

(2)

• Representation of the eternal vertex cover problem as a dynamic Stackelberg game
• Some algorithmic results for eternal vertex cover problem in graphs

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)