Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Avtomatika i Telemekhanika, 2018, Issue 12, Pages 142–166
DOI: https://doi.org/10.31857/S000523100002862-2 (Mi at14981) 		 
This article is cited in 4 scientific papers (total in 4 papers)

Optimization, System Analysis, and Operations Research

The decomposition problem for the set of paths in a directed graph and its application

D. N. Gainanov, A. I. Kibzun, V. A. Rasskazova

Moscow Aviation Institute (National State University), Moscow, Russia
Full-text PDF (774 kB) Citations (4)
References:
PDF
HTML
DOI: https://doi.org/10.31857/S000523100002862-2
Abstract: 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.
Keywords: decomposition, directed graph, strongly connected graph, algorithm, locomotive assignment.
Funding agency Grant number
Ministry of Education and Science of the Russian Federation 2.2461.2017/4.6
This work was supported by the Ministry of Education and Science of the Russian Federation, grant no. 2.2461.2017/4.6.
Presented by the member of Editorial Board: A. A. Lazarev

Received: 31.01.2018
English version:
Automation and Remote Control, 2018, Volume 79, Issue 12, Pages 2217–2236
DOI: https://doi.org/10.1134/S000511791812010X
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: D. N. Gainanov, A. I. Kibzun, V. A. Rasskazova, “The decomposition problem for the set of paths in a directed graph and its application”, Avtomat. i Telemekh., 2018, no. 12, 142–166; Autom. Remote Control, 79:12 (2018), 2217–2236
Citation in format AMSBIB
\Bibitem{GaiKibRas18}
\by D.~N.~Gainanov, A.~I.~Kibzun, V.~A.~Rasskazova
\paper The decomposition problem for the set of paths in a directed graph and its application
\jour Avtomat. i Telemekh.
\yr 2018
\issue 12
\pages 142--166
\mathnet{http://mi.mathnet.ru/at14981}
\crossref{https://doi.org/10.31857/S000523100002862-2}
\elib{https://elibrary.ru/item.asp?id=36515656}
\transl
\jour Autom. Remote Control
\yr 2018
\vol 79
\issue 12
\pages 2217--2236
\crossref{https://doi.org/10.1134/S000511791812010X}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000453228600010}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85058287411}
Linking options:
  • https://www.mathnet.ru/eng/at14981
  • https://www.mathnet.ru/eng/at/y2018/i12/p142
    • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:229
    Full-text PDF :46
    References:34
    First page:14
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024