A general heuristic bottom-up procedure for searching and/or graphs
- 31 August 1991
- journal article
- Published by Elsevier in Information Sciences
- Vol. 56 (1-3) , 39-57
- https://doi.org/10.1016/0020-0255(91)90023-n
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- AND/OR graph heuristic search methodsJournal of the ACM, 1985
- Admissible heuristic search in and/or graphsTheoretical Computer Science, 1983
- A general branch and bound formulation for understanding and synthesizing and/or tree search proceduresArtificial Intelligence, 1983
- Dynamic Programming as Graph Searching: An Algebraic ApproachJournal of the ACM, 1981
- The B∗ tree search algorithm: A best-first proof procedureArtificial Intelligence, 1979
- Optimizing decision trees through heuristically guided searchCommunications of the ACM, 1978
- A generalization of Dijkstra's algorithmInformation Processing Letters, 1977
- Solvable classes of discrete dynamic programmingJournal of Mathematical Analysis and Applications, 1973
- Equivalence between AND/OR graphs and context-free grammarsCommunications of the ACM, 1973
- A note on two problems in connexion with graphsNumerische Mathematik, 1959