Login / Signup

The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs.

Felix CanavoiErich GrädelRoman Rabinovich
Published in: Theor. Comput. Sci. (2014)
Keyphrases
  • directed graph
  • dynamic programming
  • optimal solution
  • worst case
  • maximum flow
  • data sets
  • genetic algorithm
  • learning algorithm
  • lower bound
  • undirected graph
  • decision trees
  • objective function
  • np hard
  • graph structure