Modelling and Data Analysis
2020. Vol. 10, no. 3, 60–68
doi:10.17759/mda.2020100305
ISSN: 2219-3758 / 2311-9454 (online)
Practical Realization of Algorithm of Oriented Graph Paths Decomposition
Abstract
General Information
Keywords: optimization theory, graph optimization, algorithm of directed graph paths decomposition, strongly connected graph, subgraphs
Journal rubric: Optimization Methods
Article type: scientific article
DOI: https://doi.org/10.17759/mda.2020100305
For citation: Zolotarev I.A., Rasskazova V.A. Practical Realization of Algorithm of Oriented Graph Paths Decomposition. Modelirovanie i analiz dannikh = Modelling and Data Analysis, 2020. Vol. 10, no. 3, pp. 60–68. DOI: 10.17759/mda.2020100305. (In Russ., аbstr. in Engl.)
References
- Gainanov D.N., Konygin A.V., Rasskazova V.A. Modelling railway freight traffi c using the methods of graph theory and combinatorial optimization. Automation and Remote Control, 2016 vol. 77, no. 11, pp. 1928–1943.
- Gainanov D.N., Kibzun A.I., Rasskazova V.A. Theoretical-graph algorithm in the problem on the assignments and transportations of locomotives. Herald of computer and information technologies, 2017, no. 5, pp. 51–56.
- Gainanov D.N., Kibzun A.I., Rasskazova V.A. The Decomposition Problem for the Set of Paths in a Directed Graph and Its Application. Automation and Remote Control, 2018, vol. 79, no. 12, pp. 2217–2236.
Information About the Authors
Metrics
Views
Total: 255
Previous month: 12
Current month: 2
Downloads
Total: 108
Previous month: 4
Current month: 1