{"type":"ScholarlyArticle","title":"PathLAD+: An Improved Exact Algorithm for Subgraph Isomorphism Problem","authors":[{"name":"Yiyuan Wang","slug":"yiyuan-wang","given":"Yiyuan","family":"Wang","affiliation":"School of Computer Science and Information Technology , Northeast Normal University , China; Key Laboratory of Applied Statistics of MOE , Northeast Normal University , Changchun , China"},{"name":"Chenghou Jin","slug":"chenghou-jin","given":"Chenghou","family":"Jin","affiliation":"Computer School , Beijing Information Science and Technology University , Beijing , China"},{"name":"Shaowei Cai","slug":"shaowei-cai","given":"Shaowei","family":"Cai","affiliation":"State Key Laboratory of Computer Science , Institute of Software , Chinese Academy of Sciences , Beijing , China; School of Computer Science and Technology , University of Chinese Academy of Sciences , China"},{"name":"Qingwei Lin","slug":"qingwei-lin","given":"Qingwei","family":"Lin","affiliation":"Microsoft Research , China"}],"abstract":"The subgraph isomorphism problem (SIP) is a challenging problem with wide practical applications. In the last decade, despite being a theoretical hard problem, researchers design various algorithms for solving SIP. In this work, we propose three main heuristics and develop an improved exact algorithm for SIP. First, we design a probing search procedure to try whether the search procedure can successfully obtain a solution at first sight. Second, we design a novel matching ordering as a value-ordering heuristic, which uses some useful information obtained from the probing search procedure to preferentially select some promising target vertices. Third, we discuss the characteristics of different propagation methods in the context of SIP and present an adaptive propagation method to make a good balance between these methods. Experimental results on a broad range of real-world benchmarks show that our proposed algorithm performs better than state-of-the-art algorithms for the SIP.","doi":"10.24963/ijcai.2023/626","url":"https://ijcai.org/proceedings/2023/626","pdf":"https://ijcai.org/proceedings/2023/0626.pdf","markdown":"https://ijcai.org/proceedings/2023/626.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/626","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Search","track":"Main Track","number":626,"pages":{"first":5639,"last":5647},"keywords":["Search: S: Heuristic search","Search: S: Combinatorial search and optimisation"],"videos":[],"references":[{"position":1,"raw":"[Archibald et al., 2019] Blair Archibald, Fraser Dunlop, Ruth Hoffmann, Ciaran McCreesh, Patrick Prosser, and James Trimble. Sequential and parallel solution-biased search for subgraph algorithms. In CPAIOR, pages 20-38, 2019.","title":"Sequential and parallel solution-biased search for subgraph algorithms","authors":"Archibald","year":"2019","venue":"CPAIOR","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Audemard et al., 2014] Gilles Audemard, Christophe Lecoutre, Mouny Samy-Modeliar, Gilles Goncalves, and Daniel Porumbel. Scoring-based neighborhood dominance for the subgraph isomorphism problem. In CP, pages 125-141, 2014.","title":"Scoring-based neighborhood dominance for the subgraph isomorphism problem","authors":"Gilles Audemard, Christophe Lecoutre, Mouny Samy-Modeliar, Gilles Goncalves, Daniel Porumbel","year":"2014","venue":"CP","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bonnici et al., 2013] Vincenzo Bonnici, Rosalba Giugno, Alfredo Pulvirenti, Dennis Shasha, and Alfredo Ferro. A subgraph isomorphism algorithm and its application to biochemical data. BMC bioinformatics, 14(7):1-13, 2013.","title":"A subgraph isomorphism algorithm and its application to biochemical data","authors":"Vincenzo Bonnici, Rosalba Giugno, Alfredo Pulvirenti, Dennis Shasha, Alfredo Ferro","year":"2013","venue":"BMC bioinformatics","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Carletti et al., 2017] Vincenzo Carletti, Pasquale Foggia, Alessia Saggese, and Mario Vento. Introducing vf3: A new algorithm for subgraph isomorphism. In GbRPR, pages 128-139, 2017.","title":"Introducing vf3: A new algorithm for subgraph isomorphism","authors":"Vincenzo Carletti, Pasquale Foggia, Alessia Saggese, Mario Vento","year":"2017","venue":"GbRPR","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Chen et al., 2023] Jiejiang Chen, Shaowei Cai, Yiyuan Wang, Wenhao Xu, Jia Ji, and Minghao Yin. Improved local search for the minimum weight dominating set prob- lem in massive graphs by using a deep optimization mech- anism. Artificial Intelligence, 314:103819, 2023.","title":"Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism","authors":"Jiejiang Chen, Shaowei Cai, Yiyuan Wang, Wenhao Xu, Jia Ji, Minghao Yin","year":"2023","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Cordella et al., 2004] Luigi P Cordella, Pasquale Foggia, Carlo Sansone, and Mario Vento. A (sub) graph isomor- phism algorithm for matching large graphs. IEEE Trans- actions on Pattern Analysis and Machine Intelligence, 26(10):1367-1372, 2004.","title":"A (sub) graph isomorphism algorithm for matching large graphs","authors":"Pasquale Luigi P Cordella, Carlo Foggia, Mario Sansone, Vento","year":"2004","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Damiand et al., 2011] Guillaume Damiand, Christine Sol- non, Colin De la Higuera, Jean-Christophe Janodet, and Émilie Samuel. Polynomial algorithms for subisomor- phism of nd open combinatorial maps. Computer Vision and Image Understanding, 115(7):996-1010, 2011.","title":"Polynomial algorithms for subisomorphism of nd open combinatorial maps","authors":"Guillaume Damiand, Christine Solnon, Colin De La Higuera, Jean-Christophe Janodet, Émilie Samuel","year":"2011","venue":"Computer Vision and Image Understanding","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Derigs, 1981] Ulrich Derigs. A shortest augmenting path method for solving minimal perfect matching problems. Networks, 11(4):379-390, 1981.","title":"A shortest augmenting path method for solving minimal perfect matching problems","authors":"Ulrich Derigs","year":"1981","venue":"Networks","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Gocht et al., 2020] Stephan Gocht, Ross McBride, Ciaran McCreesh, Jakob Nordström, Patrick Prosser, and James Trimble. Certifying solvers for clique and maximum com- mon (connected) subgraph problems. In CP, pages 338- 357, 2020.","title":"Certifying solvers for clique and maximum common (connected) subgraph problems","authors":"Stephan Gocht, Ross Mcbride, Ciaran Mccreesh, Jakob Nordström, Patrick Prosser, James Trimble","year":"2020","venue":"CP","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Johnson and Garey, 1979] David S Johnson and Michael R Garey. Computers and intractability: A guide to the theory of NP-completeness. WH Freeman, 1979.","title":"Computers and intractability: A guide to the theory of NP-completeness","authors":"S David, Michael R Johnson, Garey","year":"1979","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Kim et al., 2015] Jinha Kim, Hyungyu Shin, Wook-Shin Han, Sungpack Hong, and Hassan Chafi. Taming subgraph isomorphism for rdf query processing. Proceedings of the VLDB Endowment, 8(11):1238-1249, 2015.","title":"Taming subgraph isomorphism for rdf query processing","authors":"Jinha Kim, Hyungyu Shin, Wook-Shin Han, Sungpack Hong, Hassan Chafi","year":"2015","venue":"Proceedings of the VLDB Endowment","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Kotthoff et al., 2016] Lars Kotthoff, Ciaran McCreesh, and Christine Solnon. Portfolios of subgraph isomorphism al- gorithms. In LION, pages 107-122, 2016.","title":"Portfolios of subgraph isomorphism algorithms","authors":"Kotthoff","year":"2016","venue":"LION","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Kraiczy and McCreesh, 2021] Sonja Kraiczy and Ciaran McCreesh. Solving graph homomorphism and subgraph isomorphism problems faster through clique neighbour- hood constraints. In IJCAI, pages 1396-1402, 2021.","title":"Solving graph homomorphism and subgraph isomorphism problems faster through clique neighbourhood constraints","authors":"Sonja Kraiczy, Ciaran Mccreesh","year":"2021","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2021/193"},{"position":14,"raw":"[Liu et al., 2020] Yanli Liu, Chu-Min Li, Hua Jiang, and Kun He. A learning based branch and bound for maxi- mum common subgraph related problems. In AAAI, pages 2392-2399, 2020.","title":"A learning based branch and bound for maximum common subgraph related problems","authors":"Yanli Liu, Chu-Min Li, Hua Jiang, Kun He","year":"2020","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Liu et al., 2022] Yanli Liu, Jiming Zhao, Chu-Min Li, Hua Jiang, and Kun He. Hybrid learning with new value func- tion for the maximum common subgraph problem. arXiv preprint arXiv:2208.08620, 2022.","title":"Hybrid learning with new value function for the maximum common subgraph problem","authors":"Yanli Liu, Jiming Zhao, Chu-Min Li, Hua Jiang, Kun He","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Lladós et al., 2001] Josep Lladós, Enric Martí, and Juan J. Villanueva. Symbol recognition by error-tolerant subgraph matching between region adjacency graphs. IEEE Trans- actions on Pattern Analysis and Machine Intelligence, 23(10):1137-1143, 2001.","title":"Symbol recognition by error-tolerant subgraph matching between region adjacency graphs","authors":"Josep Lladós, Enric Martí, Juan J Villanueva","year":"2001","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[McCreesh and Prosser, 2015] Ciaran McCreesh and Patrick Prosser. A parallel, backjumping subgraph isomorphism algorithm using supplemental graphs. In CP, pages 295- 312, 2015.","title":"A parallel, backjumping subgraph isomorphism algorithm using supplemental graphs","authors":"Ciaran Mccreesh, Patrick Prosser","year":"2015","venue":"CP","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[McCreesh et al., 2016a] Ciaran McCreesh, Samba Ndojh Ndiaye, Patrick Prosser, and Christine Solnon. Clique and constraint models for maximum common (connected) sub- graph problems. In CP, pages 350-368, 2016.","title":"Clique and constraint models for maximum common (connected) subgraph problems","authors":"Mccreesh","year":"2016","venue":"CP","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[McCreesh et al., 2016b] Ciaran McCreesh, Patrick Prosser, and James Trimble. Heuristics and really hard instances for subgraph isomorphism problems. In IJCAI, pages 631- 638, 2016.","title":"Heuristics and really hard instances for subgraph isomorphism problems","authors":"Mccreesh","year":"2016","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2016/96"},{"position":20,"raw":"[McCreesh et al., 2017] Ciaran McCreesh, Patrick Prosser, and James Trimble. A partitioning algorithm for maxi- mum common subgraph problems. In IJCAI, pages 712- 719, 2017.","title":"A partitioning algorithm for maximum common subgraph problems","authors":"Ciaran Mccreesh, Patrick Prosser, James Trimble","year":"2017","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2017/99"},{"position":21,"raw":"[McCreesh et al., 2018] Ciaran McCreesh, Patrick Prosser, Christine Solnon, and James Trimble. When subgraph iso- morphism is really hard, and why this matters for graph databases. Journal of Artificial Intelligence Research, 61:723-759, 2018.","title":"When subgraph isomorphism is really hard, and why this matters for graph databases","authors":"Ciaran Mccreesh, Patrick Prosser, Christine Solnon, James Trimble","year":"2018","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[McCreesh et al., 2020] Ciaran McCreesh, Patrick Prosser, and James Trimble. The glasgow subgraph solver: Using constraint programming to tackle hard subgraph isomor- phism problem variants. In ICGT, pages 316-324, 2020.","title":"The glasgow subgraph solver: Using constraint programming to tackle hard subgraph isomorphism problem variants","authors":"Ciaran Mccreesh, Patrick Prosser, James Trimble","year":"2020","venue":"ICGT","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Ohlrich et al., 1993] Miles Ohlrich, Carl Ebeling, Eka Gint- ing, and Lisa Sather. Subgemini: Identifying subcircuits using a fast subgraph isomorphism algorithm. In DAC, pages 31-37, 1993.","title":"Subgemini: Identifying subcircuits using a fast subgraph isomorphism algorithm","authors":"Miles Ohlrich, Carl Ebeling, Eka Ginting, Lisa Sather","year":"1993","venue":"DAC","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Snijders et al., 2006] Tom AB Snijders, Philippa E Pattison, Garry L Robins, and Mark S Handcock. New specifica- tions for exponential random graph models. Sociological methodology, 36(1):99-153, 2006.","title":"New specifications for exponential random graph models","authors":"Philippa E Tom Ab Snijders, Garry L Pattison, Mark S Robins, Handcock","year":"2006","venue":"Sociological methodology","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Solnon et al., 2015] Christine Solnon, Guillaume Damiand, Colin De La Higuera, and Jean-Christophe Janodet. On the complexity of submap isomorphism and maximum com- mon submap problems. Pattern Recognition, 48(2):302- 316, 2015.","title":"On the complexity of submap isomorphism and maximum common submap problems","authors":"Christine Solnon, Guillaume Damiand, Colin De, La Higuera, Jean-Christophe Janodet","year":"2015","venue":"Pattern Recognition","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Solnon, 2010] Christine Solnon. Alldifferent-based filtering for subgraph isomorphism. Artificial Intelligence, 174(12- 13):850-864, 2010.","title":"Alldifferent-based filtering for subgraph isomorphism","authors":"Christine Solnon","year":"2010","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Solnon, 2019] Christine Solnon. Experimental evaluation of subgraph isomorphism solvers. In GbRPR, pages 1-13, 2019.","title":"Experimental evaluation of subgraph isomorphism solvers","authors":"Christine Solnon","year":"2019","venue":"GbRPR","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Stergiou, 2021] Kostas Stergiou. Adaptive constraint prop- agation in constraint satisfaction: review and evaluation. Artificial Intelligence Review, 54(7):5055-5093, 2021.","title":"Adaptive constraint propagation in constraint satisfaction: review and evaluation","authors":"Kostas Stergiou","year":"2021","venue":"Artificial Intelligence Review","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Wang et al., 2022] Hanchen Wang, Ying Zhang, Lu Qin, Wei Wang, Wenjie Zhang, and Xuemin Lin. Reinforce- ment learning based query vertex ordering model for sub- graph matching. In ICDE, pages 245-258, 2022.","title":"Reinforcement learning based query vertex ordering model for subgraph matching","authors":"Hanchen Wang, Ying Zhang, Lu Qin, Wei Wang, Wenjie Zhang, Xuemin Lin","year":"2022","venue":"ICDE","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Zampelli et al., 2010] Stéphane Zampelli, Yves Deville, and Christine Solnon. Solving subgraph isomorphism problems with constraint programming. Constraints, 15(3):327-353, 2010.","title":"Solving subgraph isomorphism problems with constraint programming","authors":"Stéphane Zampelli, Yves Deville, Christine Solnon","year":"2010","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Zhou et al., 2022] Jianrong Zhou, Kun He, Jiongzhi Zheng, Chu-Min Li, and Yanli Liu. A strengthened branch and bound algorithm for the maximum common (connected) subgraph problem. In IJCAI, pages 1908-1914, 2022.","title":"A strengthened branch and bound algorithm for the maximum common (connected) subgraph problem","authors":"Jianrong Zhou, Kun He, Jiongzhi Zheng, Chu-Min Li, Yanli Liu","year":"2022","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2022/265"}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}