Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/11738
DC FieldValueLanguage
dc.contributor.authorHefetz D.en
dc.contributor.authorKrivelevich M.en
dc.contributor.authorStojaković M.en
dc.contributor.authorSzabó T.en
dc.date.accessioned2020-03-03T14:45:38Z-
dc.date.available2020-03-03T14:45:38Z-
dc.date.issued2009-12-01en
dc.identifier.issn09110119en
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/11738-
dc.description.abstractIn 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.en
dc.relation.ispartofGraphs and Combinatoricsen
dc.titleFast winning strategies in avoider-enforcer gamesen
dc.typeJournal/Magazine Articleen
dc.identifier.doi10.1007/s00373-009-0870-8en
dc.identifier.scopus2-s2.0-72049088305en
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/72049088305en
dc.relation.lastpage544en
dc.relation.firstpage533en
dc.relation.issue4en
dc.relation.volume25en
item.grantfulltextnone-
item.fulltextNo Fulltext-
Appears in Collections:FTN Publikacije/Publications
Show simple item record

SCOPUSTM   
Citations

6
checked on Jul 1, 2023

Page view(s)

4
Last Week
1
Last month
0
checked on May 10, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.