Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games.
Dietmar BerwangerErich GrädelPublished in: LPAR (2004)
Keyphrases
- directed graph
- random walk
- complexity measures
- similarity measure
- maximum flow
- winning strategy
- graph structure
- modal logic
- video games
- worst case
- disjoint paths
- strongly connected
- directed acyclic graph
- undirected graph
- logic programming
- nash equilibria
- web graph
- game playing
- machine learning
- computational complexity
- dynamic programming
- game theoretic
- game design
- space complexity
- input image
- nash equilibrium
- distance measure