Pages that link to "Item:Q2437758"
From MaRDI portal
The following pages link to To satisfy impatient web surfers is hard (Q2437758):
Displaying 7 items.
- Complexity of the game domination problem (Q313955) (← links)
- Study of a combinatorial game in graphs through linear programming (Q1986957) (← links)
- Maximum rooted connected expansion (Q2034397) (← links)
- A connected version of the graph coloring game (Q2192130) (← links)
- Eternally dominating large grids (Q2328863) (← links)
- Connected surveillance game (Q2345464) (← links)
- (Q5136239) (← links)
