The Decomposition Problem for the Set of Paths in a Directed Graph and Its Application

被引：2
|
作者：
Gainanov, D. N. [1 ]
Kibzun, A. I. [1 ]
Rasskazova, V. A. [1 ]
机构：
[1] Natl State Univ, Moscow Aviat Inst, Moscow, Russia
来源：
AUTOMATION AND REMOTE CONTROL | 2018年 / 79卷 / 12期
关键词：
decomposition; directed graph; strongly connected graph; algorithm; locomotive assignment; ALGORITHM;
D O I：
10.1134/S000511791812010X
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We consider the problem of decomposing the set of paths in a directed graph and its application to reducing the dimension of an applied problem on the assignment and transportation of locomotives. On a given set of paths and a set of strongly connected subgraphs, we define a special table. To solve the graph decomposition problem, we develop a heuristic algorithm based on the idea of quicksorting the constructed table. We estimate of the complexity of the resulting algorithm. The obtained results were used to reduce the dimension of the above-mentioned applied problem. We also show the results of computational experiments.
引用
收藏
页码：2217 / 2236
页数：20
相关论文
共 50 条
  • [31] Independent separation of bipartite graph and its application in cover problem
    Che, Wengang
    Su, Lei
    Wang, Hongxiang
    Jiao, Yue
    Tien Tzu Hsueh Pao/Acta Electronica Sinica, 1998, 26 (05): : 42 - 47
  • [32] Oriented Graph Signal Decomposition Model Based on TSF and its Application
    Shen Li
    Li Yazhen
    APPLIED MECHANICS AND MECHANICAL ENGINEERING, PTS 1-3, 2010, 29-32 : 877 - 883
  • [33] The dimension of graph directed attractors with overlaps on the line, with an application to a problem in fractal image recognition
    Keane, M
    Simon, K
    Solomyak, B
    FUNDAMENTA MATHEMATICAE, 2003, 180 (03) : 279 - 292
  • [34] On the dominant set selection problem and its application to value alignment
    Marc Serramia
    Maite López-Sánchez
    Stefano Moretti
    Juan Antonio Rodríguez-Aguilar
    Autonomous Agents and Multi-Agent Systems, 2021, 35
  • [35] On the dominant set selection problem and its application to value alignment
    Serramia, Marc
    Lopez-Sanchez, Maite
    Moretti, Stefano
    Rodriguez-Aguilar, Juan Antonio
    AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS, 2021, 35 (02)
  • [36] IDENTIFICATION OF A MINIMAL FEEDBACK VERTEX SET OF A DIRECTED GRAPH
    SMITH, GW
    WALFORD, RB
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1975, CA22 (01): : 9 - 15
  • [37] A rough set framework for learning in a directed acyclic graph
    Midelfart, H
    Komorowski, J
    ROUGH SETS AND CURRENT TRENDS IN COMPUTING, PROCEEDINGS, 2002, 2475 : 144 - 155
  • [38] ON MINIMUM FEEDBACK ARC SET OF A DIRECTED GRAPH.
    Wong, Yin Wah
    Chang, Shi Kuo
    International Journal on Policy and Information, 1980, 4 (02): : 1 - 20
  • [39] Sign phase transition in the problem of interfering directed paths
    Baldwin, C. L.
    Laumann, C. R.
    Spivak, B.
    PHYSICAL REVIEW B, 2018, 97 (01)
  • [40] On the set of all shortest paths of a given length in a connected graph
    Nebesky, L
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 1996, 46 (01) : 155 - 160
12345