J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Given a large graph, stored on disk, there is often a need to perform a search over this graph. Such a need could arise, for example, in the search component of a data-intensive expert system or to solve path problems in deductive database systems. In this paper, we present a novel data structuring technique and show how a branch and bound search algorithm can use this data structuring to prune the search space. Simulation results confirm that, using these techniques, a search can be expedited significantly without incurring a large storage penalty. As a side benefit, it is possible to organize the search to.obtain successive approximations to the desired solution with considerable reduction in total search. © 1994 IEEE
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
Oliver Bodemer
IBM J. Res. Dev