Fast embedding of spanning trees in biased Maker-Breaker games.
Dan HefetzAsaf FerberMichael KrivelevichPublished in: Electron. Notes Discret. Math. (2011)
Keyphrases
- spanning tree
- edge disjoint
- minimum spanning tree
- minimum cost
- minimum spanning trees
- computer games
- game theory
- undirected graph
- high quality
- root node
- nash equilibria
- video games
- game theoretic
- lowest cost
- game design
- special case
- serious games
- weighted graph
- imperfect information
- vector space
- total length
- learning experience
- minimum total cost
- index structure