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/3047| Nаziv: | Winning fast in biased Maker-Breaker games | Аutоri: | Mikalački (Rakić), Mirjana Stojaković, Mila |
Dаtum izdаvаnjа: | 1-авг-2017 | Čаsоpis: | Electronic Notes in Discrete Mathematics | Sažetak: | © 2017 Elsevier B.V. We study the biased (1 : b) Maker-Breaker positional games, played on the edge set of the complete graph on n vertices, Kn. Given Breaker's bias b, possibly depending on n, we determine the bounds for minimal number of moves, depending on b, in which Maker can win in each of the two standard graph games, the Perfect Matching game and the Hamilton Cycle game. | URI: | https://open.uns.ac.rs/handle/123456789/3047 | DOI: | 10.1016/j.endm.2017.07.047 |
| Nаlаzi sе u kоlеkciјаmа: | PMF Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
SCOPUSTM
Nаvоđеnjа
2
prоvеrеnо 03.05.2024.
Prеglеd/i stаnicа
23
Prоtеklа nеdеljа
10
10
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.