Pages that link to "Item:Q765521"
From MaRDI portal
The following pages link to Parameterized algorithm for eternal vertex cover (Q765521):
Displaying 13 items.
- Eternal vertex cover on bipartite graphs (Q2097214) (← links)
- On graphs whose eternal vertex cover number and vertex cover number coincide (Q2161248) (← links)
- A substructure based lower bound for eternal vertex cover number (Q2235736) (← links)
- Graphs with equal eternal vertex cover and eternal domination numbers (Q2275369) (← links)
- Eternally dominating large grids (Q2328863) (← links)
- To satisfy impatient web surfers is hard (Q2437758) (← links)
- m-Secure vertex cover of a graph (Q4644785) (← links)
- A new lower bound for the eternal vertex cover number of graphs (Q5918525) (← links)
- Disentangling the computational complexity of network untangling (Q6151149) (← links)
- Eternal connected vertex cover problem in graphs: complexity and algorithms (Q6547830) (← links)
- Representation of the eternal vertex cover problem as a dynamic Stackelberg game (Q6588726) (← links)
- Some algorithmic results for eternal vertex cover problem in graphs (Q6636999) (← links)
- Stability of vertex covers in a game with finitely many steps (Q6648352) (← links)
