电邮这篇文章 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
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
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
