Computational Expansion Processes on Graphs

The article considers the problem of determining the parameters of bundles of paths on a finite oriented graph without multiple arcs (possibly with loops). Necessary and sufficient conditions are considered such that the search may be implemented by a computational procedure called a one-dimensional expansion procedure. Algorithms for the procedure are formulated and examples of possible applications are given.