Decomposition Techniques for Subgraph Matching

Stephane Zampelli, Martin Mann, Yves Deville +1

In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc…