Highly Influential

6 Excerpts

- 2012

We study the combinatorial two-player game Tron. We answer the extremal question on general graphs and also consider smaller graph classes. Bodlaender and Kloks conjectured in [2] PSPACE-completeness. We proof this conjecture.