SYSTEM AND METHOD FOR COMBINING BREADTH-FIRST AND DEPTH-FIRST SEARCH STRATEGIES WITH APPLICATIONS TO GRAPH-SEARCH PROBLEMS WITH LARGE ENCODING SIZES

摘要

A system and method to integrate breadth-first and depth-first strategies in a single search technique or routine is provided. It combines the complementary strengths of both strategies to achieve significantly improved speed over either strategy used alone. The new algorithm can be used to efficiently find solutions to the treewidth problem that has applications in areas such as diagnosis using probabilistic inferences.