Мақаланы E-mail арқылы жіберу Estimation of the Complexity of the Potential Transformation Algorithm for Solving Cyclic Games on Graphs
- Авторлар: Bashlaeva I.1, Kovkov D.2
-
Мекемелер:
- Volgograd State University
- Federal Research Center Computer Science and Control, Russian Academy of Sciences
- Шығарылым: Том 58, № 3 (2019)
- Беттер: 425-433
- Бөлім: Systems Analysis and Operations Research
- URL: https://journals.rcsi.science/1064-2307/article/view/220385
- DOI: https://doi.org/10.1134/S106423071903002X
- ID: 220385
Дәйексөз келтіру
Ашық рұқсат
Рұқсат берілді
Тек жазылушылар үшін
Аннотация
The upper bound on the complexity of the potential transformation algorithm for solving cyclic games on graphs is improved. This bound is close to the lower bound on the complexity of the potential transformation algorithm. The optimal deviation problem is reduced to a cyclic game on a directed graph.
Авторлар туралы
I. Bashlaeva
Volgograd State University
Хат алмасуға жауапты Автор.
Email: bashlaeva_ia@volsu.ru
Ресей, Volgograd, 400062
D. Kovkov
Federal Research Center Computer Science and Control, Russian Academy of Sciences
Email: bashlaeva_ia@volsu.ru
Ресей, Moscow, 119333
