No Polynomial Bound for the Period of the Parallel Chip Firing Game on Graphs.
Marcos A. KiwiRené NdoundamMaurice TchuenteEric Goles Ch.Published in: Theor. Comput. Sci. (1994)
Keyphrases
- lower bound
- upper bound
- high speed
- high density
- computer games
- alpha beta search
- level parallelism
- low cost
- single chip
- nash equilibrium
- weighted graph
- graph theoretic
- game theory
- game play
- game playing
- virtual world
- imperfect information
- computer architecture
- optimal strategy
- game theoretic
- parallel implementation
- worst case
- educational games
- graph matching
- parallel processing
- physical design
- multithreading
- learning algorithm
- nash equilibria
- parallel computing
- shared memory
- graph mining
- serious games