Representation of the eternal vertex cover problem as a dynamic Stackelberg game
type: Item
instance of: scholarly article
title: Representation of the eternal vertex cover problem as a dynamic Stackelberg game
zbMATH Open document ID: 1546.91075
DOI: 10.1007/978-3-031-47859-8_1
author: V. L. Beresnev
author: Andrey Melnikov
author: Stepan Utyupin
publication date: 2024-08-16T00:00:00Z
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91A65
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7897904
zbMATH Keywords: 1-stable vertex cover
zbMATH Keywords: protection
zbMATH Keywords: bi-level programming
MaRDI profile type: Publication
cites work: Protecting a graph with mobile guards
cites work: Q3059008
cites work: Parameterized algorithm for eternal vertex cover
cites work: Eternal vertex cover on bipartite graphs
cites work: A new lower bound for the eternal vertex cover number of graphs
cites work: A substructure based lower bound for eternal vertex cover number
cites work: Some algorithmic results for eternal vertex cover problem in graphs
cites work: Julia: A Fresh Approach to Numerical Computing
description: scientific article; zbMATH DE number 7897904