Games on interval and permutation graph representations

Enright, J. and Stewart, L. (2016) Games on interval and permutation graph representations. Theoretical Computer Science, 609(Part 1), pp. 87-103. (doi: 10.1016/j.tcs.2015.09.009)

Full text not currently available from Enlighten.


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.

Item Type:Articles
Additional Information:The authors gratefully acknowledge support from NSERC Discovery Grant RGPIN 9217, an iCORE ICT Graduate Student Scholarship and a University of Alberta Dissertation Fellowship.
Glasgow Author(s) Enlighten ID:Enright, Dr Jessica
Authors: Enright, J., and Stewart, L.
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Theoretical Computer Science
ISSN (Online):1879-2294
Published Online:11 September 2015

University Staff: Request a correction | Enlighten Editors: Update this record