Skip to main navigation
Skip to search
Skip to main content
Utrecht University Home
Help & FAQ
Home
People
Research units
Research output
Activities
In the media
Prizes & Grants
Search by expertise, name or affiliation
Complexity of path-forming games
Hans L. Bodlaender
*
*
Corresponding author for this work
Decision Support Systems
Utrecht University
Research output
:
Contribution to journal
›
Article
›
Academic
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Complexity of path-forming games'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Dynamic Programming
100%
Linear Time
100%
Polynomial-time Algorithm
100%
Two-player Games
100%
Bounded Treewidth
100%
Winning Strategy
100%
PSPACE-complete Problems
100%
PSPACE-complete
100%
Path Graph
100%
Graph Rewriting
100%
Elementary Path
100%
Path Formation
100%
Computer Science
Dynamic Programming
100%
polynomial-time algorithm
100%
Winning Strategy
100%
Mathematics
Winning Strategy
100%
Linear Time
100%
Polynomial Time
100%