Author:
Bashlaeva I. A.,Kovkov D. V.
Subject
Applied Mathematics,Computer Networks and Communications,Computer Vision and Pattern Recognition,Information Systems,Theoretical Computer Science,Control and Systems Engineering,Software
Reference14 articles.
1. V. A. Gurvich, A. V. Karzanov, and L. G. Khachiyan, “Cyclic games and finding minimax average cycles in directed graphs,” Zh. Vychisl. Mat. Mat. Fiz. 28, 1407–1417 (1988).
2. D. V. Alifanov, V. N. Lebedev, and V. I. Tsurkov, “Optimization of schedules with precedence logical conditions,” J. Comput. Syst. Sci. Int. 48, 932 (2009).
3. V. N. Lebedev and V. I. Tsurkov, “An average polynomial algorithm for solving antagonistic games on graphs,” J. Comput. Syst. Sci. Int. 57, 88 (2018).
4. U. Zwick and M. Paterson, “The complexity of mean payoff games on graphs,” Theor. Comput. Sci. 158, 343–359 (1996).
5. D. Andersson and P. B. Miltersen, “The complexity of solving stochastic games on graphs,” Lect. Notes Comput. Sci. 5878, 112 (2009).