Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/22546
Full metadata record
DC FieldValueLanguage
dc.contributor.authorEnright, Jessicaen_UK
dc.contributor.authorStewart, Lornaen_UK
dc.date.accessioned2016-01-23T00:19:07Z-
dc.date.available2016-01-23T00:19:07Z-
dc.date.issued2016-01-04en_UK
dc.identifier.urihttp://hdl.handle.net/1893/22546-
dc.description.abstractWe describe combinatorial games on graphs in which two players antagonistically build a representation of a subgraph of a given graph. We show that for a large class of these games, determining whether a given instance is a winning position for the next player is PSPACE-hard. In contrast, we give polynomial time algorithms for solving some versions of the games on trees.en_UK
dc.language.isoenen_UK
dc.publisherElsevieren_UK
dc.relationEnright J & Stewart L (2016) Games on interval and permutation graph representations. Theoretical Computer Science, 609 (1), pp. 87-103. https://doi.org/10.1016/j.tcs.2015.09.009en_UK
dc.rightsThis item has been embargoed for a period. During the embargo please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study. Accepted refereed manuscript of: Enright J & Stewart L (2016) Games on interval and permutation graph representations, Theoretical Computer Science, 609 (1), pp. 87-103. DOI: 10.1016/j.tcs.2015.09.009 © 2016, Elsevier. Licensed under the Creative Commons Attribution- NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/en_UK
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/en_UK
dc.subjectGames on graphsen_UK
dc.subjectPermutation graphsen_UK
dc.subjectInterval graphsen_UK
dc.subjectCombinatorial gamesen_UK
dc.subjectSet representations of graphsen_UK
dc.titleGames on interval and permutation graph representationsen_UK
dc.typeJournal Articleen_UK
dc.rights.embargodate2017-06-12en_UK
dc.rights.embargoreason[revisedVersionCGJun22 (1).pdf] Publisher requires embargo of 18 months after formal publication.en_UK
dc.identifier.doi10.1016/j.tcs.2015.09.009en_UK
dc.citation.jtitleTheoretical Computer Scienceen_UK
dc.citation.issn0304-3975en_UK
dc.citation.volume609en_UK
dc.citation.issue1en_UK
dc.citation.spage87en_UK
dc.citation.epage103en_UK
dc.citation.publicationstatusPublisheden_UK
dc.citation.peerreviewedRefereeden_UK
dc.type.statusAM - Accepted Manuscripten_UK
dc.author.emailjae@cs.stir.ac.uken_UK
dc.citation.date11/09/2015en_UK
dc.contributor.affiliationMathematicsen_UK
dc.contributor.affiliationUniversity of Albertaen_UK
dc.identifier.isiWOS:000367488400007en_UK
dc.identifier.scopusid2-s2.0-84945957048en_UK
dc.identifier.wtid584159en_UK
dc.contributor.orcid0000-0002-0266-3292en_UK
dc.date.accepted2015-09-07en_UK
dcterms.dateAccepted2015-09-07en_UK
dc.date.filedepositdate2015-11-25en_UK
rioxxterms.apcnot requireden_UK
rioxxterms.typeJournal Article/Reviewen_UK
rioxxterms.versionAMen_UK
local.rioxx.authorEnright, Jessica|0000-0002-0266-3292en_UK
local.rioxx.authorStewart, Lorna|en_UK
local.rioxx.projectInternal Project|University of Stirling|https://isni.org/isni/0000000122484331en_UK
local.rioxx.freetoreaddate2017-06-12en_UK
local.rioxx.licencehttp://www.rioxx.net/licenses/under-embargo-all-rights-reserved||2017-06-11en_UK
local.rioxx.licencehttp://creativecommons.org/licenses/by-nc-nd/4.0/|2017-06-12|en_UK
local.rioxx.filenamerevisedVersionCGJun22 (1).pdfen_UK
local.rioxx.filecount1en_UK
local.rioxx.source0304-3975en_UK
Appears in Collections:Computing Science and Mathematics Journal Articles

Files in This Item:
File Description SizeFormat 
revisedVersionCGJun22 (1).pdfFulltext - Accepted Version503.83 kBAdobe PDFView/Open


This item is protected by original copyright



A file in this item is licensed under a Creative Commons License Creative Commons

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

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.