An accelerated search on the graph: PROLOG representation

zbMATH Open0996.05111MaRDI QIDQ2764343

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

evaluation functionsaccelerated searchhandling graphs

Mathematics Subject Classification ID

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

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Graph traversal and top-down evaluation of logic queries 👍 👎
• Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search 👍 👎
• Path querying on acyclic graphs using Boolean grammars 👍 👎
• Path Logics for Querying Graphs: Combining Expressiveness and Efficiency 👍 👎
• 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)