{"type":"ScholarlyArticle","title":"A Partitioning Algorithm for Maximum Common Subgraph Problems","authors":[{"name":"Ciaran McCreesh","slug":"ciaran-mccreesh","given":"Ciaran","family":"McCreesh","affiliation":"University of Glasgow , Glasgow , Scotland"},{"name":"Patrick Prosser","slug":"patrick-prosser","given":"Patrick","family":"Prosser","affiliation":"University of Glasgow , Glasgow , Scotland"},{"name":"James Trimble","slug":"james-trimble","given":"James","family":"Trimble","affiliation":"University of Glasgow , Glasgow , Scotland"}],"abstract":"We introduce a new branch and bound algorithm for the maximum common subgraph and maximum common connected subgraph problems which is based around vertex labelling and partitioning. Our method in some ways resembles a traditional constraint programming approach, but uses a novel compact domain store and supporting inference algorithms which dramatically reduce the memory and computation requirements during search, and allow better dual viewpoint ordering heuristics to be calculated cheaply.  Experiments show a speedup of more than an order of magnitude over the state of the art, and demonstrate that we can operate on much larger graphs without running out of memory.","doi":"10.24963/ijcai.2017/99","url":"https://ijcai.org/proceedings/2017/99","pdf":"https://ijcai.org/proceedings/2017/0099.pdf","markdown":"https://ijcai.org/proceedings/2017/99.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/99","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Constraints and Satisfiability","track":"Main track","number":99,"pages":{"first":712,"last":719},"keywords":["Constraints and Satisfiability: Constraint Satisfaction","Combinatorial & Heuristic Search: Combinatorial search/optimisation","Constraints and Satisfiability: Constraint Optimisation"],"videos":[],"references":[{"position":1,"raw":"[Bahiense et al., 2012] Laura Bahiense, Gordana Manic, Breno Piva, and Cid C. de Souza. The maximum com- mon edge subgraph problem: A polyhedral investigation. Discrete Applied Mathematics, 160(18):2523-2541, 2012.","title":"The maximum common edge subgraph problem: A polyhedral investigation","authors":"Laura Bahiense, Gordana Manic, Breno Piva, Cid C De Souza","year":"2012","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bron and Kerbosch, 1973] Coenraad Bron and Joep Ker- bosch. Finding all cliques of an undirected graph (algo- rithm 457). Commun. ACM, 16(9):575-576, 1973.","title":"Finding all cliques of an undirected graph (algorithm 457)","authors":"Kerbosch Bron","year":"1973","venue":"Commun. ACM","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bunke, 1997] Horst Bunke. On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters, 18(8):689-694, 1997.","title":"On a relation between graph edit distance and maximum common subgraph","authors":"Horst Bunke","year":"1997","venue":"Pattern Recognition Letters","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Conte et al., 2007] Donatello Conte, Pasquale Foggia, and Mario Vento. Challenging complexity of maximum com- mon subgraph detection algorithms: A performance anal- ysis of three algorithms on a wide database of graphs. J. Graph Algorithms Appl., 11(1):99-143, 2007.","title":"Challenging complexity of maximum common subgraph detection algorithms: A performance analysis of three algorithms on a wide database of graphs","authors":"Conte","year":"2007","venue":"J. Graph Algorithms Appl","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Cook and Holder, 1994] Diane J. Cook and Lawrence B. Holder. Substructure discovery using minimum descrip- tion length and background knowledge. J. Artif. Intell. Res. (JAIR), 1:231-255, 1994.","title":"Substructure discovery using minimum description length and background knowledge","authors":"Diane J Cook, Lawrence B Holder","year":"1994","venue":"J. Artif. Intell. Res. (JAIR)","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Djoko et al., 1997] Surnjani Djoko, Diane J. Cook, and Lawrence B. Holder. An empirical study of domain knowl- edge and its benefits to substructure discovery. IEEE Trans. Knowl. Data Eng., 9(4):575-586, 1997.","title":"An empirical study of domain knowledge and its benefits to substructure discovery","authors":"Djoko","year":"1997","venue":"IEEE Trans. Knowl. Data Eng","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Droschinsky et al., 2016] Andre Droschinsky, Nils M. Kriege, and Petra Mutzel. Faster algorithms for the maximum common subtree isomorphism problem. In 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland, pages 33:1-33:14, 2016.","title":"Faster algorithms for the maximum common subtree isomorphism problem","authors":"Andre Droschinsky, Nils M Kriege, Petra Mutzel","year":"2016","venue":"41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Droschinsky et al., 2017] Andre Droschinsky, Nils Kriege, and Petra Mutzel. Finding largest common substructures of molecules in quadratic time. In SOFSEM 2017: The- ory and Practice of Computer Science -43rd Interna- tional Conference on Current Trends in Theory and Prac- tice of Computer Science, Limerick, Ireland, January 16- 20, 2017, Proceedings, pages 309-321, 2017.","title":"Finding largest common substructures of molecules in quadratic time","authors":"Droschinsky","year":"2017","venue":"SOFSEM 2017: Theory and Practice of Computer Science -43rd International Conference on Current Trends in Theory and Practice of Computer Science","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Ehrlich and Rarey, 2011] Hans-Christian Ehrlich and Matthias Rarey. Maximum common subgraph isomor- phism algorithms and their applications in molecular science: a review. Wiley Interdisciplinary Reviews: Computational Molecular Science, 1(1):68-79, 2011.","title":"Maximum common subgraph isomorphism algorithms and their applications in molecular science: a review","authors":"Rarey ; Hans-Christian Ehrlich, Matthias Ehrlich, Rarey","year":"2011","venue":"Wiley Interdisciplinary Reviews: Computational Molecular Science","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Fernández and Valiente, 2001] Mirtha-Lina Fernández and Gabriel Valiente. A graph distance metric combining maximum common subgraph and minimum common su- pergraph. Pattern Recognition Letters, 22(6/7):753-758, 2001.","title":"Mirtha-Lina Fernández and Gabriel Valiente. A graph distance metric combining maximum common subgraph and minimum common supergraph","authors":"Valiente Fernández","year":"2001","venue":"Pattern Recognition Letters","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Gay et al., 2014] Steven Gay, Franc ¸ois Fages, Thierry Mar- tinez, Sylvain Soliman, and Christine Solnon. On the sub- graph epimorphism problem. Discrete Applied Mathemat- ics, 162:214-228, 2014.","title":"On the subgraph epimorphism problem","authors":"Steven Gay, Thierry Franc ¸ois Fages, Sylvain Martinez, Christine Soliman, Solnon","year":"2014","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Geelen, 1992] P. A. Geelen. Dual viewpoint heuristics for binary constraint satisfaction problems. In ECAI, pages 31-35, 1992.","title":"Dual viewpoint heuristics for binary constraint satisfaction problems","authors":"P A Geelen","year":"1992","venue":"ECAI","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Grindley et al., 1993] Helen M. Grindley, Peter J. Artymiuk, David W. Rice, and Peter Willett. Identi- fication of tertiary structure resemblance in proteins using a maximal common subgraph isomorphism algorithm. Journal of Molecular Biology, 229(3):707-721, 1993.","title":"Identification of tertiary structure resemblance in proteins using a maximal common subgraph isomorphism algorithm","authors":"Helen M Grindley, Peter J Artymiuk, David W Rice, Peter Willett","year":"1993","venue":"Journal of Molecular Biology","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Hoffmann et al., 2017] Ruth Hoffmann, Ciaran McCreesh, and Craig Reilly. Between subgraph isomorphism and maximum common subgraph. In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA, pages 3907-3914, 2017.","title":"Between subgraph isomorphism and maximum common subgraph","authors":"Hoffmann","year":"2017","venue":"Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Kotthoff et al., 2016] Lars Kotthoff, Ciaran McCreesh, and Christine Solnon. Portfolios of subgraph isomorphism al- gorithms. In Learning and Intelligent Optimization -10th International Conference, LION 10, Ischia, Italy, May 29 -June 1, 2016, Revised Selected Papers, pages 107-122, 2016.","title":"Portfolios of subgraph isomorphism algorithms","authors":"Kotthoff","year":"2016","venue":"Learning and Intelligent Optimization -10th International Conference, LION 10","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Kriege, 2015] Nils Kriege. Comparing graphs. PhD thesis, Technische Universität Dortmund, 2015.","title":"Comparing graphs","authors":"Nils Kriege","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Levi, 1973] G. Levi. A note on the derivation of maximal common subgraphs of two directed or undirected graphs. CALCOLO, 9(4):341-352, 1973.","title":"A note on the derivation of maximal common subgraphs of two directed or undirected graphs","authors":"G Levi","year":"1973","venue":"CALCOLO","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[López-Presa and Anta, 2009] José Luis López-Presa and Antonio Fernández Anta. Fast algorithm for graph iso- morphism testing. In Experimental Algorithms, 8th In- ternational Symposium, SEA 2009, Dortmund, Germany, June 4-6, 2009. Proceedings, pages 221-232, 2009.","title":"José Luis López-Presa and Antonio Fernández Anta. Fast algorithm for graph isomorphism testing","authors":"López-Presa, Anta","year":"2009","venue":"Experimental Algorithms, 8th International Symposium, SEA 2009","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[McCreesh et al., 2016] Ciaran McCreesh, Samba Ndojh Ndiaye, Patrick Prosser, and Christine Solnon. Clique and constraint models for maximum common (connected) subgraph problems. In Principles and Practice of Con- straint Programming -22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceed- ings, pages 350-368, 2016.","title":"Clique and constraint models for maximum common (connected) subgraph problems","authors":"Ciaran Mccreesh, Samba Ndojh Ndiaye, Patrick Prosser, Christine Solnon","year":"2016","venue":"Principles and Practice of Constraint Programming -22nd International Conference, CP 2016","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[McKay and Piperno, 2014] Brendan D. McKay and Adolfo Piperno. Practical graph isomorphism, II. J. Symb. Com- put., 60:94-112, 2014.","title":"Practical graph isomorphism","authors":"Brendan D Mckay, Adolfo Piperno","year":"2014","venue":"II. J. Symb. Comput","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Ndiaye and Solnon, 2011] Samba Ndojh Ndiaye and Chris- tine Solnon. CP models for maximum common subgraph problems. In Principles and Practice of Constraint Pro- gramming -CP 2011 -17th International Conference, CP 2011, Perugia, Italy, September 12-16, 2011. Proceedings, pages 637-644, 2011.","title":"Samba Ndojh Ndiaye and Christine Solnon. CP models for maximum common subgraph problems","authors":"Solnon Ndiaye","year":"2011","venue":"Principles and Practice of Constraint Programming -CP 2011 -17th International Conference, CP 2011","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Park et al., 2013] Young Hee Park, Douglas S. Reeves, and Mark Stamp. Deriving common malware behavior through graph clustering. Computers & Security, 39:419-430, 2013.","title":"Deriving common malware behavior through graph clustering","authors":"Park","year":"2013","venue":"Computers & Security","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Raymond and Willett, 2002] John W. Raymond and Peter Willett. Maximum common subgraph isomorphism algo- rithms for the matching of chemical structures. Journal of Computer-Aided Molecular Design, 16(7):521-533, 2002.","title":"Maximum common subgraph isomorphism algorithms for the matching of chemical structures","authors":"John W Raymond, Peter Willett","year":"2002","venue":"Journal of Computer-Aided Molecular Design","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Redmond and Cunningham, 2013] Ursula Redmond and Pádraig Cunningham. Temporal subgraph isomorphism. In Advances in Social Networks Analysis and Mining 2013, ASONAM '13, Niagara, ON, Canada -August 25 -29, 2013, pages 1451-1452, 2013.","title":"Ursula Redmond and Pádraig Cunningham. Temporal subgraph isomorphism","authors":"Cunningham Redmond","year":"2013","venue":"Advances in Social Networks Analysis and Mining 2013","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Santo et al., 2003] Massimo De Santo, Pasquale Foggia, Carlo Sansone, and Mario Vento. A large database of graphs and its use for benchmarking graph isomorphism algorithms. Pattern Recognition Letters, 24(8):1067- 1079, 2003.","title":"A large database of graphs and its use for benchmarking graph isomorphism algorithms","authors":"Massimo De, Santo, Pasquale Foggia, Carlo Sansone, Mario Vento","year":"2003","venue":"Pattern Recognition Letters","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Vismara and Valery, 2008] Philippe Vismara and Benoît Valery. Finding maximum common connected subgraphs using clique detection or constraint satisfaction algo- rithms. In Modelling, Computation and Optimization in Information Systems and Management Sciences, Second International Conference, MCO 2008, Metz, France -Lux- embourg, September 8-10, 2008. Proceedings, pages 358- 368, 2008.","title":"Finding maximum common connected subgraphs using clique detection or constraint satisfaction algorithms","authors":"Philippe Vismara, Benoît Valery","year":"2008","venue":"Modelling, Computation and Optimization in Information Systems and Management Sciences, Second International Conference, MCO 2008","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}