Spanning tree game as prim would have played
In this paper, we investigate special types of Maker-Breaker games defined on graphs. We restrict Maker’s possible moves that resembles the way that was introduced by Espig, Frieze, Krivelevich and Pedgen [9]. Here, we require that the subgraph induced by Maker’s edges must be connected throughout t...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2018
|
| Sorozat: | Acta cybernetica
23 No. 3 |
| Kulcsszavak: | Számítógépes játékok, Gráf |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/55685 |
| Tartalmi kivonat: | In this paper, we investigate special types of Maker-Breaker games defined on graphs. We restrict Maker’s possible moves that resembles the way that was introduced by Espig, Frieze, Krivelevich and Pedgen [9]. Here, we require that the subgraph induced by Maker’s edges must be connected throughout the game. Besides the normal play, we examine the biased and accelerated versions of these games. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 921-928 |
| ISSN: | 0324-721X |