An Algorithm for Covering the Vertices of a Directed Graph
Year: 2021
Type: article
Abstract: The article presents an algorithm for solving the applied problem of assigning and moving locomotives, based on the solution of the graph–theoretic problem of covering the vertices of a directed graph with a set of oriented paths. A detailed example is given for an algorithm for covering the vertices of a directed graph with a set of maximal paths.
Source: Modelling and Data Analysis
Authors: M.O. Knyazyatov, V.A. Rasskazova
Institution: Moscow Aviation Institute
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W3165722755