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/1905
Nаziv: | Fast strategies in biased Maker-Breaker games | Аutоri: | Mikalački (Rakić), Mirjana Stojaković, Mila |
Dаtum izdаvаnjа: | 1-јан-2018 | Čаsоpis: | Discrete Mathematics and Theoretical Computer Science | Sažetak: | © 2018 by the author(s). 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 the 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/1905 | ISSN: | 14627264 |
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а
1
prоvеrеnо 22.02.2020.
Prеglеd/i stаnicа
15
Prоtеklа nеdеljа
3
3
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
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.