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 条
  • [21] AN ALGORITHM FOR HIERARCHICAL REDUCTION AND DECOMPOSITION OF A DIRECTED GRAPH
    SCHWARZE, J
    COMPUTING, 1980, 25 (01) : 47 - 57
  • [22] Set-to-Set Disjoint Paths Problem in Mobius Cubes
    Ichida, Hiroyuki
    Kaneko, Keiichi
    IEEE ACCESS, 2022, 10 : 83075 - 83084
  • [23] A PARALLEL ALGORITHM FOR THE PROBLEM OF SHORTEST PATHS ON A GRAPH
    LISTROVOY, SV
    SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES, 1991, 29 (03): : 60 - 66
  • [24] PLANAR GRAPH DECOMPOSITION AND ALL PAIRS SHORTEST PATHS
    FREDERICKSON, GN
    JOURNAL OF THE ACM, 1991, 38 (01) : 162 - 204
  • [25] On the weighted safe set problem on paths and cycles
    Shinya Fujita
    Tommy Jensen
    Boram Park
    Tadashi Sakuma
    Journal of Combinatorial Optimization, 2019, 37 : 685 - 701
  • [26] On the weighted safe set problem on paths and cycles
    Fujita, Shinya
    Jensen, Tommy
    Park, Boram
    Sakuma, Tadashi
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 37 (02) : 685 - 701
  • [27] Decomposition of Directed Graphs and the Turan Problem
    Novikov, B. V.
    Polyakova, L. Yu
    Zholtkevich, G. N.
    UKRAINIAN MATHEMATICAL JOURNAL, 2014, 66 (07) : 1070 - 1084
  • [28] FINDING K-DISJOINT PATHS IN A DIRECTED PLANAR GRAPH
    SCHRIJVER, A
    SIAM JOURNAL ON COMPUTING, 1994, 23 (04) : 780 - 788
  • [29] Regular decomposition of the edge set of a graph with applications
    Csaba, Bela
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2024, 89 : 249 - 267
  • [30] The stable set problem and the thinness of a graph
    Mannino, Carlo
    Oriolo, Gianpaolo
    Ricci, Federico
    Chandran, Sunil
    OPERATIONS RESEARCH LETTERS, 2007, 35 (01) : 1 - 9
12345