Please use this identifier to cite or link to this item:
Appears in Collections:Computing Science and Mathematics Journal Articles
Peer Review Status: Refereed
Title: Games on interval and permutation graph representations
Authors: Enright, Jessica
Stewart, Lorna
Contact Email:
Keywords: Games on graphs
Permutation graphs
Interval graphs
Combinatorial games
Set representations of graphs
Issue Date: 4-Jan-2016
Publisher: Elsevier
Citation: Enright J & Stewart L (2016) Games on interval and permutation graph representations, Theoretical Computer Science, 609 (1), pp. 87-103.
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.
Type: Journal Article
DOI Link:
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
Affiliation: Mathematics - CSM Dept
University of Alberta

Files in This Item:
File Description SizeFormat 
revisedVersionCGJun22 (1).pdf503.83 kBAdobe PDFUnder Embargo until 5/7/2017     Request a copy

Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependant on the depositor still being contactable at their original email address.

This item is protected by original copyright

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

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