资源分类
》 资源 》论文》Solving Hard Subgraph Problems in Parallel

Solving Hard Subgraph Problems in Parallel

2019-11-25 | |  44 |   48 |   0
Abstract We look at problems involving finding subgraphs in larger graphs, such as the maximum clique problem, the subgraph isomorphism problem, and the maximum common subgraph problem. We investigate variable and value ordering heuristics, different inference strategies, intelligent backtracking search (backjumping), and bitand thread-parallelism to exploit modern hardware.

上一篇：Modelling Satisfiability Problems Theory and Practice

下一篇：On the Synergy of Network Science and Artificial Intelligence

用户评价
全部评价

热门资源

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

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

  • Learning to Predi...

    Much of model-based reinforcement learning invo...