Representation of the eternal vertex cover problem as a dynamic Stackelberg game

DOI10.1007/978-3-031-47859-8_1zbMATH Open1546.91075MaRDI QIDQ6588726

Andrey Melnikov, V. L. Beresnev, Stepan Utyupin

Publication date: 16 August 2024

zbMATH Keywords

protectionbi-level programming1-stable vertex cover

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Hierarchical games (including Stackelberg games) (91A65) Games involving graphs (91A43)

Cites Work

• Unnamed Item
• Parameterized algorithm for eternal vertex cover
• Eternal vertex cover on bipartite graphs
• A substructure based lower bound for eternal vertex cover number
• Julia: A Fresh Approach to Numerical Computing
• Protecting a graph with mobile guards
• A new lower bound for the eternal vertex cover number of graphs
• Some algorithmic results for eternal vertex cover problem in graphs

Related Items (1)

Stability of vertex covers in a game with finitely many steps

This page was built for publication: Representation of the eternal vertex cover problem as a dynamic Stackelberg game