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 条
  • [1] The Decomposition Problem for the Set of Paths in a Directed Graph and Its Application
    D. N. Gainanov
    A. I. Kibzun
    V. A. Rasskazova
    Automation and Remote Control, 2018, 79 : 2217 - 2236
  • [2] Application of directed topology decomposition in consensus problem
    Xu, Yaojin
    Tian, Yu-Ping
    2014 SIXTH INTERNATIONAL CONFERENCE ON INTELLIGENT HUMAN-MACHINE SYSTEMS AND CYBERNETICS (IHMSC), VOL 2, 2014, : 125 - 129
  • [3] Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time
    Crespelle, Christophe
    Thierry, Eric
    DISCRETE MATHEMATICS, 2015, 338 (12) : 2393 - 2407
  • [4] About the Set of Independent Paths in the Graph
    Starikov, P. P.
    Terentyeva, Yu Yu
    CYBERNETICS PERSPECTIVES IN SYSTEMS, VOL 3, 2022, 503 : 401 - 409
  • [5] GENERATION OF SIMPLE PATHS OF GRAPH BY DECOMPOSITION
    CAHIT, I
    CAHIT, R
    ELECTRONICS LETTERS, 1974, 10 (02) : 13 - 14
  • [6] THE PATH SET POLYTOPE OF AN ACYCLIC, DIRECTED GRAPH WITH AN APPLICATION TO MACHINE SEQUENCING
    VATE, JHV
    NETWORKS, 1989, 19 (05) : 607 - 614
  • [7] MINIMUM CONFLUENT CUT OF A DIRECTED GRAPH AND ITS APPLICATION TO THE BLOCK REPLACEMENT PROBLEM IN VLSI DESIGN.
    Kajitani, Yoji
    Tsuji, Katsufumi
    Chen, Ray R.
    Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi), 1987, 70 (10): : 22 - 30
  • [8] Algorithm and its application of N Shortest Paths Problem
    Chai, DF
    Zhang, DR
    2001 INTERNATIONAL CONFERENCES ON INFO-TECH AND INFO-NET PROCEEDINGS, CONFERENCE A-G: INFO-TECH & INFO-NET: A KEY TO BETTER LIFE, 2001, : A387 - A391
  • [9] DOMINATING SET AND CONVERSE DOMINATING SET OF A DIRECTED GRAPH
    FU, Y
    AMERICAN MATHEMATICAL MONTHLY, 1968, 75 (08): : 861 - +
  • [10] Probabilistic signed directed graph and its application in hazard assessment
    Yang Fan
    Xiao Deyun
    PROGRESS IN SAFETY SCIENCE AND TECHNOLOGY, VOL 6, PTS A AND B, 2006, 6 : 111 - 115
12345