An accelerated search on the graph: prolog representation
Matematičeskoe modelirovanie, Tome 13 (2001) no. 6, pp. 19-22
Cet article a éte moissonné depuis 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},
year = {2001},
volume = {13},
number = {6},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/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/