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 条
  • [11] Decomposition of the Kneser Graph into paths of length four
    Whitt, T. R., III
    Rodger, C. A.
    DISCRETE MATHEMATICS, 2015, 338 (08) : 1284 - 1288
  • [12] Common Fixed Point Results via Set-Valued Generalized Weak Contraction with Directed Graph and Its Application
    Shoaib, Muhammad
    Sarwar, Muhammad
    Shah, Kamal
    Mlaiki, Nabil
    JOURNAL OF MATHEMATICS, 2022, 2022
  • [13] H-core decomposition for directed networks and its application
    Chen, Xiaoyu
    Liu, Yang
    Cao, Zhenxin
    Li, Xiaopeng
    Cao, Jinde
    SCIENTOMETRICS, 2024, 129 (11) : 6571 - 6596
  • [14] FINDING A HOMOTOPY BASE FOR DIRECTED PATHS IN AN ACYCLIC GRAPH
    MUROTA, K
    FUJISHIGE, S
    DISCRETE APPLIED MATHEMATICS, 1987, 17 (1-2) : 157 - 162
  • [15] Configuration spaces and directed paths on the final precubical set
    Paliga, Jakub
    Ziemianski, Krzysztof
    FUNDAMENTA MATHEMATICAE, 2022, 257 (03) : 229 - 263
  • [16] COVERING EDGE SET OF A DIRECTED GRAPH WITH TREES
    VIDYASANKAR, K
    DISCRETE MATHEMATICS, 1978, 24 (01) : 79 - 85
  • [17] Partitions of the edge set of a graph into internally disjoint paths
    Vijayakumar, G. R.
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2007, 39 : 241 - 245
  • [18] A construction for the hat problem on a directed graph
    Hod, Rani
    Krzywkowski, Marcin
    ELECTRONIC JOURNAL OF COMBINATORICS, 2012, 19 (01):
  • [19] A Generalization of the Directed Graph Layering Problem
    Rueegg, Ulf
    Ehlers, Thorsten
    Spoenemann, Miro
    von Hanxleden, Reinhard
    GRAPH DRAWING AND NETWORK VISUALIZATION (GD 2016), 2016, 9801 : 196 - 208
  • [20] Spectral graph fractional Fourier transform for directed graphs and its application
    Yan, Fang-Jia
    Li, Bing-Zhao
    SIGNAL PROCESSING, 2023, 210
12345