Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/1905
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mikalački (Rakić), Mirjana | en_US |
dc.contributor.author | Stojaković, Mila | en_US |
dc.date.accessioned | 2019-09-23T10:18:28Z | - |
dc.date.available | 2019-09-23T10:18:28Z | - |
dc.date.issued | 2018-01-01 | - |
dc.identifier.issn | 14627264 | en_US |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/1905 | - |
dc.description.abstract | © 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. | en |
dc.relation.ispartof | Discrete Mathematics and Theoretical Computer Science | en |
dc.title | Fast strategies in biased Maker-Breaker games | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.scopus | 2-s2.0-85056528848 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/85056528848 | - |
dc.description.version | Unknown | en_US |
dc.relation.issue | 2 | en |
dc.relation.volume | 20 | en |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
crisitem.author.dept | Prirodno-matematički fakultet, Departman za matematiku i informatiku | - |
crisitem.author.orcid | 0000-0002-1268-2972 | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
Appears in Collections: | PMF Publikacije/Publications |
SCOPUSTM
Citations
1
checked on Feb 22, 2020
Page view(s)
15
Last Week
3
3
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.