资源分类
》 资源 》论文》Heuristics and Really Hard Instances for Subgraph Isomorphism Problems

Heuristics and Really Hard Instances for Subgraph Isomorphism Problems

2019-11-22 | |  42 |   35 |   0
Abstract We show how to generate “really hard” random instances for subgraph isomorphism problems. For the non-induced variant, we predict and observe a phase transition between satisfiable and unsatisfiable instances, with a corresponding complexity peak seen in three different solvers. For the induced variant, much richer behaviour is observed, and constrainedness gives a better measure of difficulty than does proximity to a phase transition. We also discuss variable and value ordering heuristics, and their relationship to the expected number of solutions.

上一篇：FastLCD: Fast Label Coordinate Descent for the Efficient Optimization of 2D Label MRFs

下一篇：Markov Chain Analysis of Noise and Restart in Stochastic Local Search

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...