Computer Science – Computational Complexity
Scientific paper
2011-10-14
Computer Science
Computational Complexity
Scientific paper
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.
No associations
LandOfFree
Tron, a combinatorial Game on abstract Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Tron, a combinatorial Game on abstract Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tron, a combinatorial Game on abstract Graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-523239