Skip to main content
Conference Proceedings

Tron, a combinatorial game on abstract graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7288 LNCS 293-304
DOI: 10.1007/978-3-642-30347-0_29
4Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We study the combinatorial two-player game . We answer the extremal question on general graphs and also consider smaller graph classes. Bodlaender and Kloks conjectured in [2] PSPACE- completeness. We prove this conjecture. © 2012 Springer-Verlag Berlin Heidelberg.

Author supplied keywords

Cite

CITATION STYLE

APA

Miltzow, T. (2012). Tron, a combinatorial game on abstract graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7288 LNCS, pp. 293–304). https://doi.org/10.1007/978-3-642-30347-0_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free