The Software for Constructing Trails with Local Restrictions in Graphs

Tatyana Panyukova, Igor Alferov
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
more » ... nd allowable Eulerian cycle for Eulerian graph or to proclaim that such a cycle does not exist by the time All presented algorithms have the software realization.
doi:10.4236/ojdm.2013.32017 fatcat:adcrk3uqdvgszmjrulhzf23aey