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 条
  • [41] Dynamic Domain Decomposition Method and Its Application on Nonlinear Problem
    GONG Rongfang1
    2. School of Mathematics and Statistics
    WuhanUniversityJournalofNaturalSciences, 2010, 15 (01) : 16 - 20
  • [42] AN ALGORITHM FOR THE RURAL POSTMAN PROBLEM ON A DIRECTED GRAPH
    CHRISTOFIDES, N
    CAMPOS, V
    CORBERAN, A
    MOTA, E
    MATHEMATICAL PROGRAMMING STUDY, 1986, 26 : 155 - 166
  • [43] THE STEINER PROBLEM IN A DIRECTED GRAPH - FORMULATIONS AND RELAXATIONS
    MACULAN, N
    ARPIN, D
    NGUYEN, S
    MATEMATICA APLICADA E COMPUTACIONAL, 1988, 7 (02): : 109 - 118
  • [44] DECOMPOSITION OF COMPLETE DIRECTED GRAPH INTO K-CIRCUITS
    BERMOND, JC
    FABER, V
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1976, 21 (02) : 146 - 155
  • [45] Uncovering Hidden Structure through Parallel Problem Decomposition for the Set Basis Problem: Application to Materials Discovery
    Xue, Yexiang
    Ermon, Stefano
    Gomes, Carla P.
    Selman, Bart
    PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), 2015, : 146 - 154
  • [46] GRAPH MINERS .13. THE DISJOINT PATHS PROBLEM
    ROBERTSON, N
    SEYMOUR, PD
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1995, 63 (01) : 65 - 110
  • [47] ASYMPTOTIC APPROACH TO THE MULTICRITERIA PROBLEM OF THE GRAPH COVERING BY PATHS
    KOCHKAROV, AM
    DOKLADY AKADEMII NAUK BELARUSI, 1983, 27 (10): : 911 - 913
  • [48] Maximum weight independent set of circular-arc graph and its application
    Mandal S.
    Pal M.
    Journal of Applied Mathematics and Computing, 2006, 22 (3) : 161 - 174
  • [49] A theory of tie-set graph and its application to information network management
    Shinomiya, N
    Koide, T
    Watanabe, H
    INTERNATIONAL JOURNAL OF CIRCUIT THEORY AND APPLICATIONS, 2001, 29 (04) : 367 - 379
  • [50] The widest k-set of disjoint paths problem
    Ribeiro, Marco Antonio
    Carvalho, Iago Augusto
    Pereira, Armando Honorio
    RAIRO-OPERATIONS RESEARCH, 2023, 57 (01) : 87 - 97
12345