Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/11738
Nаziv: | Fast winning strategies in avoider-enforcer games | Аutоri: | Hefetz D. Krivelevich M. Stojaković M. Szabó T. |
Dаtum izdаvаnjа: | 1-дец-2009 | Čаsоpis: | Graphs and Combinatorics | Sažetak: | In numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not who wins but rather how fast can one win. These types of problems were studied earlier for Maker-Breaker games; here we initiate their study for unbiased Avoider-Enforcer games played on the edge set of the complete graph Kn on n vertices. For several games that are known to be an Enforcer's win, we estimate quite precisely the minimum number of moves Enforcer has to play in order to win. We consider the non-planarity game, the connectivity game and the non-bipartite game. © 2009 Springer-Verlag 2009. | URI: | https://open.uns.ac.rs/handle/123456789/11738 | ISSN: | 09110119 | DOI: | 10.1007/s00373-009-0870-8 |
Nаlаzi sе u kоlеkciјаmа: | FTN Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
SCOPUSTM
Nаvоđеnjа
6
prоvеrеnо 01.07.2023.
Prеglеd/i stаnicа
4
Prоtеklа nеdеljа
1
1
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.