Skip to main content
SpringerLink
Log in
Book cover

International Conference on Principles and Practice of Constraint Programming

CP 2015: Principles and Practice of Constraint Programming pp 295–312Cite as

A Parallel, Backjumping Subgraph Isomorphism Algorithm Using Supplemental Graphs

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 9255))

Abstract

The subgraph isomorphism problem involves finding a pattern graph inside a target graph. We present a new bit- and thread-parallel constraint-based search algorithm for the problem, and experiment on a wide range of standard benchmark instances to demonstrate its effectiveness. We introduce supplemental graphs, to create implied constraints. We use a new low-overhead, lazy variation of conflict directed backjumping which interacts safely with parallel search, and a counting-based all-different propagator which is better suited for large domains.

C. McCreesh—This work was supported by the Engineering and Physical Sciences Research Council [grant number EP/K503058/1]

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Audemard, G., Lecoutre, C., Samy-Modeliar, M., Goncalves, G., Porumbel, D.: Scoring-based neighborhood dominance for the subgraph isomorphism problem. In: O’Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 125–141. Springer, Heidelberg (2014). http://dx.doi.org/10.1007/978-3-319-10428-7_12

    Google Scholar 

  2. Bessière, C., Régin, J.: MAC and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems. In: Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, Cambridge, Massachusetts, USA, August 19–22, 1996, pp. 61–75 (1996). http://dx.doi.org/10.1007/3-540-61551-2_66

  3. Bonnici, V., Giugno, R., Pulvirenti, A., Shasha, D., Ferro, A.: A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinformatics 14(Suppl 7), S13 (2013). http://www.biomedcentral.com/1471-2105/14/S7/S13

    Article  Google Scholar 

  4. de Bruin, A., Kindervater, G.A.P., Trienekens, H.W.J.M.: Asynchronous parallel branch and bound and anomalies. In: Ferreira, A., Rolim, J.D.P. (eds.) IRREGULAR 1995. LNCS, vol. 980, pp. 363–377. Springer, Heidelberg (1995). http://dx.doi.org/10.1007/3-540-60321-2_29

    Chapter  Google Scholar 

  5. Chen, X., van Beek, P.: Conflict-directed backjumping revisited. J. Artif. Intell. Res. (JAIR) 14, 53–81 (2001). http://dx.doi.org/10.1613/jair.788

    MATH  Google Scholar 

  6. Chu, G., Schulte, C., Stuckey, P.J.: Confidence-based work stealing in parallel constraint programming. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 226–241. Springer, Heidelberg (2009). http://dx.doi.org/10.1007/978-3-642-04244-7_20

    Chapter  Google Scholar 

  7. Coffman, T., Greenblatt, S., Marcus, S.: Graph-based technologies for intelligence analysis. Commun. ACM 47(3), 45–47 (2004). http://doi.acm.org/10.1145/971617.971643

    Article  Google Scholar 

  8. Conrad, J., Mathew, J.: A backjumping search algorithm for a distributed memory multicomputer. In: International Conference on Parallel Processing, ICPP 1994, vol. 3, pp. 243–246, August 1994

    Google Scholar 

  9. Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. International Journal of Pattern Recognition and Artificial Intelligence 18(03), 265–298 (2004). http://www.worldscientific.com/doi/abs/10.1142/S0218001404003228

    Article  Google Scholar 

  10. Cope, M., Gent, I.P., Hammond, K.: Parallel heuristic search in Haskell. In: Selected Papers from the 2nd Scottish Functional Programming Workshop (SFP00), University of St Andrews, Scotland, July 26–28, 2000, pp. 65–76 (2000)

    Google Scholar 

  11. Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26(10), 1367–1372 (2004). http://doi.ieeecomputersociety.org/10.1109/TPAMI.2004.75

    Article  Google Scholar 

  12. Damiand, G., Solnon, C., de la Higuera, C., Janodet, J.C., Samuel, É.: Polynomial algorithms for subisomorphism of \(n\)D open combinatorial maps. Computer Vision and Image Understanding 115(7), 996–1010 (2011). http://www.sciencedirect.com/science/article/pii/S1077314211000816, special issue on Graph-Based Representations in Computer Vision

    Article  Google Scholar 

  13. Geelen, P.A.: Dual viewpoint heuristics for binary constraint satisfaction problems. In: ECAI, pp. 31–35 (1992)

    Google Scholar 

  14. Gent, I.P., Miguel, I., Moore, N.C.A.: Lazy explanations for constraint propagators. In: Carro, M., Peña, R. (eds.) PADL 2010. LNCS, vol. 5937, pp. 217–233. Springer, Heidelberg (2010). http://dx.doi.org/10.1007/978-3-642-11503-5_19

    Chapter  Google Scholar 

  15. Gent, I.P., Miguel, I., Nightingale, P.: Generalised arc consistency for the alldifferent constraint: An empirical survey. Artificial Intelligence 172(18), 1973–2000 (2008). http://www.sciencedirect.com/science/article/pii/S0004370208001410, special Review Issue

    Article  MATH  MathSciNet  Google Scholar 

  16. Giugno, R., Bonnici, V., Bombieri, N., Pulvirenti, A., Ferro, A., Shasha, D.: Grapes: A software for parallel searching on biological graphs targeting multi-core architectures. PLoS ONE 8(10), e76911 (2013) http://dx.doi.org/10.1371%2Fjournal.pone.0076911

  17. Habbas, Z., Herrmann, F., Merel, P.P., Singer, D.: Load balancing strategies for parallel forward search algorithm with conflict based backjumping. In: Proceedings of the 1997 International Conference on Parallel and Distributed Systems, pp. 376–381, December 1997

    Google Scholar 

  18. Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: IJCAI (1), pp. 607–615. Morgan Kaufmann, San Francisco (1995)

    Google Scholar 

  19. Kessel, P.V., Quimper, C.: Filtering algorithms based on the word-RAM model. In: Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22–26, 2012, Toronto, Ontario, Canada. (2012). http://www.aaai.org/ocs/index.php/AAAI/AAAI12/paper/view/5135

  20. Larrosa, J., Valiente, G.: Constraint satisfaction algorithms for graph pattern matching. Mathematical Structures in Computer Science 12(4), 403–422 (2002). http://dx.doi.org/10.1017/S0960129501003577

    Article  MATH  MathSciNet  Google Scholar 

  21. Lobachev, O.: Parallel computation skeletons with premature termination property. In: Schrijvers, T., Thiemann, P. (eds.) FLOPS 2012. LNCS, vol. 7294, pp. 197–212. Springer, Heidelberg (2012). http://dx.doi.org/10.1007/978-3-642-29822-6_17

    Chapter  Google Scholar 

  22. MacIntyre, E., Prosser, P., Smith, B.M., Walsh, T.: Random constraint satisfaction: theory meets practice. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, p. 325. Springer, Heidelberg (1998). http://dx.doi.org/10.1007/3-540-49481-2_24

    Chapter  Google Scholar 

  23. Malitsky, Y.: Instance-Specific Algorithm Configuration. Springer (2014). http://dx.doi.org/10.1007/978-3-319-11230-5

  24. McCreesh, C., Prosser, P.: The shape of the search tree for the maximum clique problem and the implications for parallel branch and bound. ACM Trans. Parallel Comput. 2(1), 8:1–8:27 (2015). http://doi.acm.org/10.1145/2742359

    Article  Google Scholar 

  25. McGregor, J.J.: Relational consistency algorithms and their application in finding subgraph and graph isomorphisms. Inf. Sci. 19(3), 229–250 (1979). http://dx.doi.org/10.1016/0020-0255(79)90023–9

    Article  MATH  MathSciNet  Google Scholar 

  26. Prosser, P.: Domain filtering can degrade intelligent backtracking search. In: Proceedings of the 13th International Joint Conference on Artifical Intelligence, IJCAI 1993 ,vol. 1, pp. 262–267. Morgan Kaufmann Publishers Inc., San Francisco (1993). http://dl.acm.org/citation.cfm?id=1624025.1624062

  27. Prosser, P.: Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence 9, 268–299 (1993). http://dx.doi.org/10.1111/j.1467-8640.1993.tb00310.x

    Article  Google Scholar 

  28. Puget, J.: A fast algorithm for the bound consistency of alldiff constraints. In: Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, AAAI 1998, IAAI 1998, July 26–30, 1998, Madison, Wisconsin, USA, pp. 359–366 (1998). http://www.aaai.org/Library/AAAI/1998/aaai98-051.php

  29. Quimper, C.-G., Walsh, T.: The all different and global cardinality constraints on set, multiset and tuple variables. In: Hnich, B., Carlsson, M., Fages, F., Rossi, F. (eds.) CSCLP 2005. LNCS (LNAI), vol. 3978, pp. 1–13. Springer, Heidelberg (2006). http://dx.doi.org/10.1007/11754602_1

    Chapter  Google Scholar 

  30. Régin, J.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31– August 4, 1994, vol. 1, pp. 362–367 (1994). http://www.aaai.org/Library/AAAI/1994/aaai94-055.php

  31. Régin, J.C.: Développement d’outils algorithmiques pour l’Intelligence Artificielle. Application à la chimie organique. Ph.D. thesis, Université Montpellier 2 (1995)

    Google Scholar 

  32. San Segundo, P., Rodriguez-Losada, D., Galan, R., Matia, F., Jimenez, A.: Exploiting CPU bit parallel operations to improve efficiency in search. In: 19th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2007, vol. 1, pp. 53–59, October 2007

    Google Scholar 

  33. Sevegnani, M., Calder, M.: Bigraphs with sharing. Theoretical Computer Science 577, 43–73 (2015). http://www.sciencedirect.com/science/article/pii/S0304397515001085

    Article  MATH  MathSciNet  Google Scholar 

  34. Slater, N., Itzchack, R., Louzoun, Y.: Mid size cliques are more common in real world networks than triangles. Network Science 2, 387–402 (2014). http://journals.cambridge.org/article_S2050124214000228

    Article  Google Scholar 

  35. Smith, B.M., Grant, S.A.: Modelling exceptionally hard constraint satisfaction problems. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 182–195. Springer, Heidelberg (1997). http://dx.doi.org/10.1007/BFb0017439

    Chapter  Google Scholar 

  36. Solnon, C.: Alldifferent-based filtering for subgraph isomorphism. Artif. Intell. 174(12–13), 850–864 (2010). http://dx.doi.org/10.1016/j.artint.2010.05.002

    Article  MATH  MathSciNet  Google Scholar 

  37. Solnon, C., Damiand, G., de la Higuera, C., Janodet, J.C.: On the complexity of submap isomorphism and maximum common submap problems. Pattern Recognition 48(2), 302–316 (2015). http://www.sciencedirect.com/science/article/pii/S0031320314002192

    Article  Google Scholar 

  38. Trienekens, H.W.: Parallel Branch and Bound Algorithms. Ph.D. thesis, Erasmus University Rotterdam (1990)

    Google Scholar 

  39. Ullmann, J.R.: An algorithm for subgraph isomorphism. Journal of the ACM (JACM) 23(1), 31–42 (1976)

    Article  MathSciNet  Google Scholar 

  40. Ullmann, J.R.: Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism. J. Exp. Algorithmics 15, 1.6:1.1–1.6:1.64 (2011). http://doi.acm.org/10.1145/1671970.1921702

    Google Scholar 

  41. Zampelli, S., Deville, Y., Solnon, C.: Solving subgraph isomorphism problems with constraint programming. Constraints 15(3), 327–353 (2010). http://dx.doi.org/10.1007/s10601-009-9074-3

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Glasgow, Glasgow, Scotland

    Ciaran McCreesh & Patrick Prosser

Authors
  1. Ciaran McCreesh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Patrick Prosser
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ciaran McCreesh .

Editor information

Editors and Affiliations

  1. École Polytechnique de Montréal, Montréal, Québec, Canada

    Gilles Pesant

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

McCreesh, C., Prosser, P. (2015). A Parallel, Backjumping Subgraph Isomorphism Algorithm Using Supplemental Graphs. In: Pesant, G. (eds) Principles and Practice of Constraint Programming. CP 2015. Lecture Notes in Computer Science(), vol 9255. Springer, Cham. https://doi.org/10.1007/978-3-319-23219-5_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23219-5_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23218-8

  • Online ISBN: 978-3-319-23219-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation