Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/22546
Appears in Collections:Computing Science and Mathematics Journal Articles
Peer Review Status: Refereed
Title: Games on interval and permutation graph representations
Author(s): Enright, Jessica
Stewart, Lorna
Contact Email: jae@cs.stir.ac.uk
Keywords: Games on graphs
Permutation graphs
Interval graphs
Combinatorial games
Set representations of graphs
Issue Date: 4-Jan-2016
Date Deposited: 25-Nov-2015
Citation: Enright 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.009
Abstract: We 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.
DOI Link: 10.1016/j.tcs.2015.09.009
Rights: This 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/
Licence URL(s): http://creativecommons.org/licenses/by-nc-nd/4.0/

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.