A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
The Software for Constructing Trails with Local Restrictions in Graphs
2013
Open Journal of Discrete Mathematics
The present research considers the problem of covering a graph with minimal number of trails satisfying the pre-defined local restrictions. The research is devoted to the problem of graph covering by minimal number of trails satisfying some local restrictions. Algotithm of allowed Eulerian cycle construction is considered. The authors showed that it is possible to recognize the system of transitions and solve the problem of constructing the allowable path by linear time. It's also possible to
doi:10.4236/ojdm.2013.32017
fatcat:adcrk3uqdvgszmjrulhzf23aey