Article
Details
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.
Keywords
Games on graphs; Permutation graphs; Interval graphs; Combinatorial games; Set representations of graphs
Journal
Theoretical Computer Science: Volume 609, Issue 1
| Status | Published |
|---|---|
| Publication date | 04/01/2016 |
| Publication date online | 11/09/2015 |
| Date accepted by journal | 07/09/2015 |
| URL | |
| Publisher | Elsevier |
| ISSN | 0304-3975 |