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 |
| LEADER | 01160nab a2200229 i 4500 | ||
|---|---|---|---|
| 001 | acta55685 | ||
| 005 | 20220621082835.0 | ||
| 008 | 181108s2018 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a London András | |
| 245 | 1 | 0 | |a Spanning tree game as prim would have played |h [elektronikus dokumentum] / |c London András |
| 260 | |c 2018 | ||
| 300 | |a 921-928 | ||
| 490 | 0 | |a Acta cybernetica |v 23 No. 3 | |
| 520 | 3 | |a 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. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítógépes játékok, Gráf | ||
| 700 | 0 | 1 | |a Pluhár András |e aut |
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/55685/1/actacyb_23_3_2018_12.pdf |z Dokumentum-elérés |