The paths with local restrictions
Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie, no. 5 (2010), pp. 58-67
Voir la notice de l'article provenant de la source Math-Net.Ru
The research is devoted to the problem of graph covering by minimal number of trails corresponding some local restrictions. The opportunity to recognize the transitions system is observed. The problem of allowed path construction has linear complexity. Algorithm of allowed Eulerian cycle construction is also considered. If graph does not have such a cycle then algorithm constructs covering of graph by allowed trails. This algorithm also runs by linear time.
Keywords:
graph, path, trail, forbidden transition, covering.
@article{VYURU_2010_5_a7,
author = {T. A. Panyukova},
title = {The paths with local restrictions},
journal = {Vestnik \^U\v{z}no-Uralʹskogo gosudarstvennogo universiteta. Seri\^a, Matemati\v{c}eskoe modelirovanie i programmirovanie},
pages = {58--67},
publisher = {mathdoc},
number = {5},
year = {2010},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VYURU_2010_5_a7/}
}
TY - JOUR AU - T. A. Panyukova TI - The paths with local restrictions JO - Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie PY - 2010 SP - 58 EP - 67 IS - 5 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/VYURU_2010_5_a7/ LA - ru ID - VYURU_2010_5_a7 ER -
T. A. Panyukova. The paths with local restrictions. Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie, no. 5 (2010), pp. 58-67. http://geodesic.mathdoc.fr/item/VYURU_2010_5_a7/