资源分类
》 资源 》论文》Combining Breadth-First and Depth-First Strategies in Searching for Treewidth

Combining Breadth-First and Depth-First Strategies in Searching for Treewidth

2019-11-15 | |  106 |   49 |   0

Abstract Breadth-fifirst and depth-fifirst search are basic search strategies upon which many other search algorithms are built. In this paper, we describe an approach to integrating these two strategies in a single algorithm that combines the complementary strengths of both. We show the benefifits of this approach using the treewidth problem as an example

上一篇：A* Search with Inconsistent Heuristics

下一篇：Mixing Search Strategies for Multi-Player Games

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...