{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T17:54:28Z","timestamp":1772042068939,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,8,1]],"date-time":"2009-08-01T00:00:00Z","timestamp":1249084800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1007\/s10601-009-9074-3","type":"journal-article","created":{"date-parts":[[2009,7,31]],"date-time":"2009-07-31T08:37:21Z","timestamp":1249029441000},"page":"327-353","source":"Crossref","is-referenced-by-count":61,"title":["Solving subgraph isomorphism problems with constraint programming"],"prefix":"10.1007","volume":"15","author":[{"given":"St\u00e9phane","family":"Zampelli","sequence":"first","affiliation":[]},{"given":"Yves","family":"Deville","sequence":"additional","affiliation":[]},{"given":"Christine","family":"Solnon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,8,1]]},"reference":[{"key":"9074_CR1","volume-title":"Linked: How everything is connected to everything else and what it means","author":"A-L Barabasi","year":"2003","unstructured":"Barabasi, A.-L. (2003). Linked: How everything is connected to everything else and what it means. New York: Plume."},{"key":"9074_CR2","series-title":"LNCS","first-page":"789","volume-title":"Proceedings of the 9th international conference on principles and practice of constraint programming (CP)","author":"C Bessi\u00e8re","year":"2003","unstructured":"Bessi\u00e8re, C., & Van Hentenryck, P. (2003). To be or not to be .\u2009.\u2009. a global constraint. In Proceedings of the 9th international conference on principles and practice of constraint programming (CP). LNCS (Vol. 2833, pp. 789\u2013794). New York: Springer."},{"issue":"3","key":"9074_CR3","first-page":"265","volume":"18","author":"D Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., & Vento, M. (2004). Thirty years of graph matching in pattern recognition. IJPRAI, 18(3), 265\u2013298.","journal-title":"IJPRAI"},{"key":"9074_CR4","first-page":"1582","volume-title":"ICPR \u201998: Proceedings of the 14th international conference on pattern recognition","author":"L Cordella","year":"1998","unstructured":"Cordella, L., Foggia, P., Sansone, C., Tortella, F., & Vento, M. (1998). Graph matching: A fast algorithm and its evaluation. In ICPR \u201998: Proceedings of the 14th international conference on pattern recognition (Vol. 2, p. 1582). Washington, DC: IEEE Computer Society."},{"key":"9074_CR5","unstructured":"Cordella, L., Foggia, P., Sansone, C., & Vento, M. (2001). An improved algorithm for matching large graphs. In 3rd IAPR-TC15 workshop on graph-based representations in pattern recognition (pp. 149\u2013159). Cuen."},{"key":"9074_CR6","doi-asserted-by":"crossref","first-page":"1172","DOI":"10.1109\/ICIAP.1999.797762","volume-title":"ICIAP \u201999: Proceedings of the 10th international conference on image analysis and processing","author":"LP Cordella","year":"1999","unstructured":"Cordella, L. P., Foggia, P., Sansone, C., & Vento, M. (1999). Performance evaluation of the vf graph matching algorithm. In ICIAP \u201999: Proceedings of the 10th international conference on image analysis and processing (p. 1172). Washington, DC: IEEE Computer Society."},{"key":"9074_CR7","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T. H., Stein, C., Rivest, R. L., & Leiserson, C. E. (2001). Introduction to algorithms. New York: McGraw-Hill Higher Education."},{"key":"9074_CR8","first-page":"530","volume-title":"Proc. Design Automation Conference (DAC)","author":"PT Darga","year":"2004","unstructured":"Darga, P. T., Liffiton, M. H., Sakallah, K. A., & Markov, I. L. (2004). Exploiting structure in symmetry detection for cnf. In Proc. Design Automation Conference (DAC) (pp. 530\u2013534). Piscataway: IEEE\/ACM."},{"key":"9074_CR9","unstructured":"Deville, Y., Dooms, G., Zampelli, S., & Dupont, P. (2005). Cp(graph+map) for approximate graph matching. In 1st international workshop on constraint programming beyond finite integer domains, CP2005 (pp. 33\u201348)."},{"key":"9074_CR10","doi-asserted-by":"crossref","unstructured":"Dooms, G., Deville, Y., & Dupont, P. (2005). Cp(graph): Introducing a graph computation domain in constraint programming. In Principles and practice of constraint programming. Lecture Notes in Computer Science (Vol. 3709, pp. 211\u2013225).","DOI":"10.1007\/11564751_18"},{"key":"9074_CR11","unstructured":"Foggia, P., Sansone, C., & Vento, M.: A database of graphs for isomorphism and sub-graph isomorphism benchmarking. CoRR cs.PL\/0105015."},{"key":"9074_CR12","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0004-3702(83)80012-5","volume":"21","author":"G Fowler","year":"1983","unstructured":"Fowler, G., Haralick, R., Gray, F. G., Feustel, C., & Grinstead, C. (1983). Efficient graph automorphism by vertex partitioning. Artificial Intelligence, 21, 245\u2013269.","journal-title":"Artificial Intelligence"},{"key":"9074_CR13","volume-title":"Computers and intractability","author":"M Garey","year":"1979","unstructured":"Garey, M., & Johnson, D. (1979). Computers and intractability. New York: Freeman."},{"key":"9074_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/978-3-540-71681-5_7","volume-title":"RECOMB","author":"JA Grochow","year":"2007","unstructured":"Grochow, J. A., & Kellis, M. (2007). Network motif discovery using subgraph enumeration and symmetry-breaking. In T. P. Speed, & H. Huang (Eds.), RECOMB. Lecture Notes in Computer Science (Vol. 4453, pp. 92\u2013106). New York: Springer."},{"issue":"2\u20133","key":"9074_CR15","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.ipl.2006.11.016","volume":"102","author":"J Guo","year":"2007","unstructured":"Guo, J., Hueffner, F., & Moser, H. (2007). Feedback arc set in bipartite tournaments is np-complete. Information Processing Letters, 102(2\u20133), 62\u201365.","journal-title":"Information Processing Letters"},{"issue":"4","key":"9074_CR16","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J. E., & Karp, R. M. (1973). An $\\text{n}^{\\mbox{5\/2}}$ algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 2(4), 225\u2013231.","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"9074_CR17","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1017\/S0960129501003577","volume":"12","author":"J Larrosa","year":"2002","unstructured":"Larrosa, J., & Valiente, G. (2002). Constraint satisfaction algorithms for graph pattern matching, Mathematical. Structures in Computer Science, 12(4), 403\u2013422.","journal-title":"Structures in Computer Science"},{"key":"9074_CR18","first-page":"45","volume":"30","author":"BD McKay","year":"1981","unstructured":"McKay, B. D. (1981). Practical graph isomorphism. Congressus Numerantium, 30, 45\u201387.","journal-title":"Congressus Numerantium"},{"key":"9074_CR19","unstructured":"R\u00e9gin, J. (1995). D\u00e9veloppement d\u2019outils algorithmiques pour l\u2019intelligence artificielle. Application \u00e0 la chimie organique, Ph.D. thesis."},{"key":"9074_CR20","unstructured":"Regin, J.-C. (1994). A filtering algorithm for constraints of difference in CSPs. In Proc. 12th conf. American assoc. artificial intelligence. Amer. assoc. artificial intelligence (Vol.\u00a01, pp. 362\u2013367)."},{"key":"9074_CR21","series-title":"Lecture Notes in Computer Science","first-page":"238","volume-title":"Theory and application of graph transformations","author":"M Rudolf","year":"1998","unstructured":"Rudolf, M. (1998). Utilizing constraint satisfaction techniques for efficient graph pattern matching. In Theory and application of graph transformations. Lecture Notes in Computer Science (No. 1764, pp. 238\u2013252). New York: Springer."},{"key":"9074_CR22","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/978-3-540-24664-0_20","volume-title":"International conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CP-AI-OR 2004)","author":"S Sorlin","year":"2004","unstructured":"Sorlin, S., & Solnon, C. (2004). A global constraint for graph isomorphism problems. In 6th International conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CP-AI-OR 2004). LNCS (Vol. 3011, pp. 287\u2013301). New York: Springer-Verlag."},{"key":"9074_CR23","unstructured":"Sorlin, S., & Solnon, C. (2006). A new filtering algorithm for the graph isomorphism problem. In 3rd International workshop on constraint propagation and implementation. CP2006."},{"issue":"4","key":"9074_CR24","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1007\/s10601-008-9044-1","volume":"13","author":"S Sorlin","year":"2008","unstructured":"Sorlin, S., & Solnon, C. (2008). A parametric filtering algorithm for the graph isomorphism problem. Constraints, 13(4), 518\u2013537.","journal-title":"Constraints"},{"issue":"1","key":"9074_CR25","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann, J. R. (1976). An algorithm for subgraph isomorphism. Journal of the ACM, 23(1), 31\u201342.","journal-title":"Journal of the ACM"},{"key":"9074_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04921-1","volume-title":"Algorithms on trees and graphs","author":"G Valiente","year":"2002","unstructured":"Valiente, G. (2002). Algorithms on trees and graphs. Berlin: Springer."},{"key":"9074_CR27","unstructured":"Zampelli, S. (2008). A constraint programming approcah to subgraph isomorphism. Ph.D. thesis, UCLouvain, Department of Computing Science & Engineering."},{"key":"9074_CR28","doi-asserted-by":"crossref","unstructured":"Zampelli, S., Deville, Y., & Dupont, P. (2005). Approximate constrained subgraph matching. In Principles and practice of constraint programming. Lecture notes in computer science (Vol. 3709, pp. 832\u2013836).","DOI":"10.1007\/11564751_74"},{"key":"9074_CR29","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1007\/978-3-540-74970-7_51","volume-title":"Proc. 13th conf. of principles and practice of constraint programming","author":"S Zampelli","year":"2007","unstructured":"Zampelli, S., Deville, Y., Solnon, C., Sorlin, S., & Dupont, P. (2007). Filtering for subgraph isomorphism. In Proc. 13th conf. of principles and practice of constraint programming. Lecture notes in computer science (pp. 728\u2013742). New York: Springer."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-009-9074-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-009-9074-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-009-9074-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:14:15Z","timestamp":1559243655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-009-9074-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,1]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["9074"],"URL":"https:\/\/doi.org\/10.1007\/s10601-009-9074-3","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,1]]}}}