An accelerated search on the graph: prolog representation
Matematičeskoe modelirovanie, Tome 13 (2001) no. 6, pp. 19-22.

Voir la notice de l'article provenant de la source Math-Net.Ru

The issue describes the method of handling graph using evaluation function as the way to accelerated search. Tests results are given confirming this function's efficiency.
@article{MM_2001_13_6_a3,
     author = {S. I. Shapovalova},
     title = {An accelerated search on the graph: prolog representation},
     journal = {Matemati\v{c}eskoe modelirovanie},
     pages = {19--22},
     publisher = {mathdoc},
     volume = {13},
     number = {6},
     year = {2001},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MM_2001_13_6_a3/}
}
TY  - JOUR
AU  - S. I. Shapovalova
TI  - An accelerated search on the graph: prolog representation
JO  - Matematičeskoe modelirovanie
PY  - 2001
SP  - 19
EP  - 22
VL  - 13
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MM_2001_13_6_a3/
LA  - ru
ID  - MM_2001_13_6_a3
ER  - 
%0 Journal Article
%A S. I. Shapovalova
%T An accelerated search on the graph: prolog representation
%J Matematičeskoe modelirovanie
%D 2001
%P 19-22
%V 13
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MM_2001_13_6_a3/
%G ru
%F MM_2001_13_6_a3
S. I. Shapovalova. An accelerated search on the graph: prolog representation. Matematičeskoe modelirovanie, Tome 13 (2001) no. 6, pp. 19-22. http://geodesic.mathdoc.fr/item/MM_2001_13_6_a3/