• A dynamic algorithm for reachability games on trees

      Khoussainov, B; Liu, J; Khaliq, I (Springer, 2009)
      Our goal is to start the investigation of dynamic algorithms for solving games that are played on finite graphs. The dynamic game determinacy problem calls for finding efficient algorithms that decide the winner of the ...
    • A dynamic algorithm for reachability games on trees

      Khoussainov, B; Liu, J; Khaliq, I (Springer Berlin / Heidelberg, 2009)
      Our goal is to start the investigation of dynamic algorithms for solving games that are played on finite graphs. The dynamic game determinacy problem calls for finding efficient algorithms that decide the winner of the ...
    • Extracting winning strategies in update games

      Liu, J; Khaliq, I; Khoussainov, B (Springer Berlin / Heidelberg, 2011)
      This paper investigates algorithms for extracting winning strategies in two-player games played on nite graphs. We focus on a special class of games called update games. We present a procedure for extracting winning ...