Fast embedding of spanning trees in biased Maker-Breaker games.
Asaf FerberDan HefetzMichael KrivelevichPublished in: Eur. J. Comb. (2012)
Keyphrases
- spanning tree
- edge disjoint
- minimum spanning tree
- minimum cost
- minimum spanning trees
- game theory
- undirected graph
- computer games
- game theoretic
- vector space
- game play
- coalitional games
- video games
- nash equilibria
- game playing
- educational games
- graph embedding
- game design
- nash equilibrium
- weighted graph
- online game
- data structure
- imperfect information
- total length
- times faster
- minimum total cost