An accelerated search on the graph: PROLOG representation

MaRDI QIDQ2764343zbMATH OpenFDO

Authors S. I. Shapovalova

Publication date 3 July 2002

Published in Matematicheskoe Modelirovanie (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/mm/v13/i6/p19

zbMATH Keywords

accelerated searchevaluation functionshandling graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 1083038
• Graph traversal and top-down evaluation of logic queries
• Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search
• scientific article; zbMATH DE number 638303
• scientific article; zbMATH DE number 1538872
• Path logics for querying graphs: combining expressiveness and efficiency
• Path querying on acyclic graphs using Boolean grammars
• The complexity of searching succinctly represented graphs

This page was built for publication: An accelerated search on the graph: PROLOG representation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2764343)