Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/3047
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:25:22Z | - |
dc.date.available | 2019-09-23T10:25:22Z | - |
dc.date.issued | 2017-08-01 | - |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/3047 | - |
dc.description.abstract | © 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. | en |
dc.relation.ispartof | Electronic Notes in Discrete Mathematics | en |
dc.title | Winning fast in biased Maker-Breaker games | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.doi | 10.1016/j.endm.2017.07.047 | - |
dc.identifier.scopus | 2-s2.0-85026724953 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/85026724953 | - |
dc.description.version | Unknown | en_US |
dc.relation.lastpage | 868 | en |
dc.relation.firstpage | 863 | en |
dc.relation.volume | 61 | 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
2
checked on May 3, 2024
Page view(s)
23
Last Week
10
10
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.