{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:06:39Z","timestamp":1773655599729,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642237850","type":"print"},{"value":"9783642237867","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23786-7_48","type":"book-chapter","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T07:58:42Z","timestamp":1314777522000},"page":"637-644","source":"Crossref","is-referenced-by-count":13,"title":["CP Models for Maximum Common Subgraph Problems"],"prefix":"10.1007","author":[{"given":"Samba Ndojh","family":"Ndiaye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christine","family":"Solnon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"48_CR1","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0167-8655(97)00179-7","volume":"19","author":"H. Bunke","year":"1998","unstructured":"Bunke, H., Sharer, K.: A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters\u00a019(3), 255\u2013259 (1998)","journal-title":"Pattern Recognition Letters"},{"key":"48_CR2","volume-title":"Computer and intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computer and intractability. Freeman, New York (1979)"},{"key":"48_CR3","unstructured":"R\u00e9gin, J.-C.: D\u00e9veloppement d\u2019Outils Algorithmiques pour l\u2019Intelligence Artificielle. Application \u00e0 la Chimie Organique. PhD thesis, Universit\u00e9 Montpellier II (1995)"},{"issue":"7","key":"48_CR4","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1023\/A:1021271615909","volume":"16","author":"J.W. Raymond","year":"2002","unstructured":"Raymond, J.W., Willett, P.: Maximum common subgraph isomorphism algorithms for the matching of chemical structures. Journal of Computeraided Molecular Design\u00a016(7), 521\u2013533 (2002)","journal-title":"Journal of Computeraided Molecular Design"},{"issue":"4","key":"48_CR5","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1137\/0215075","volume":"15","author":"E. Balas","year":"1986","unstructured":"Balas, E., Yu, C.S.: Finding a maximum clique in an arbitrary graph. SIAM Journal on Computing\u00a015(4), 1054\u20131068 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"48_CR6","unstructured":"Durand, P.J., Pasari, R., Baker, J.W., Tsai, C.: An efficient algorithm for similarity analysis of molecules. Internet Journal of Chemistry\u00a02 (1999)"},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"Raymond, J.W., Gardiner, E.J., Willett, P.: Calculation of graph similarity using maximum common edge subgraphs. The Computer Journal\u00a045(6) (2002)","DOI":"10.1093\/comjnl\/45.6.631"},{"issue":"1","key":"48_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/spe.4380120103","volume":"12","author":"J.J. McGregor","year":"1982","unstructured":"McGregor, J.J.: Backtrack search algorithms and the maximal common subgraph problem. Software Practice and Experience\u00a012(1), 23\u201334 (1982)","journal-title":"Software Practice and Experience"},{"issue":"1","key":"48_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.7155\/jgaa.00139","volume":"11","author":"D. Conte","year":"2007","unstructured":"Conte, D., Foggia, P., Vento, M.: Challenging complexity of maximum common subgraph detection algorithms: A performance analysis of three algorithms on a wide database of graphs. Graph Algorithms and Applications\u00a011(1), 99\u2013143 (2007)","journal-title":"Graph Algorithms and Applications"},{"issue":"1","key":"48_CR10","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-540-87477-5_39","volume":"14","author":"P. Vismara","year":"2008","unstructured":"Vismara, P., Valery, B.: Finding maximum common connected subgraphs using clique detection or constraint satisfaction algorithms. Communications in Computer and Information Science\u00a014(1), 358\u2013368 (2008)","journal-title":"Communications in Computer and Information Science"},{"issue":"1","key":"48_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10601-006-9010-8","volume":"12","author":"N. Beldiceanu","year":"2007","unstructured":"Beldiceanu, N., Carlsson, M., Demassey, S., Petit, T.: Global constraint catalog: Past, present and future. Constraints\u00a012(1), 21\u201362 (2007)","journal-title":"Constraints"},{"key":"48_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-3-540-48085-3_14","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"F. Focacci","year":"1999","unstructured":"Focacci, F., Lodi, A., Milano, M.: Cost-based domain filtering. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 189\u2013203. Springer, Heidelberg (1999)"},{"key":"48_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/3-540-45578-7_31","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"T. Petit","year":"2001","unstructured":"Petit, T., R\u00e9gin, J.-C., Bessi\u00e8re, C.: Specific filtering algorithms for over-constrained problems. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 451\u2013464. Springer, Heidelberg (2001)"},{"key":"48_CR14","unstructured":"R\u00e9gin, J.-C.: A filtering algorithm for constraints of difference in csps. In: AAAI 1994, pp. 362\u2013367 (1994)"},{"issue":"18","key":"48_CR15","doi-asserted-by":"publisher","first-page":"1973","DOI":"10.1016\/j.artint.2008.10.006","volume":"172","author":"I. Gent","year":"2008","unstructured":"Gent, I., Miguel, I., Nightingale, P.: Generalised arc consistency for the alldiff constraint: An empirical survey. Artificial Intelligence\u00a0172(18), 1973\u20132000 (2008)","journal-title":"Artificial Intelligence"},{"issue":"4","key":"48_CR16","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n5\/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing\u00a02(4), 225\u2013231 (1973)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"48_CR17","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/s10601-008-9044-1","volume":"13","author":"S. Sorlin","year":"2008","unstructured":"Sorlin, S., Solnon, C.: A parametric filtering algorithm for the graph isomorphism problem. Constraints\u00a013(4), 518\u2013537 (2008)","journal-title":"Constraints"},{"issue":"3","key":"48_CR18","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10601-009-9074-3","volume":"15","author":"S. Zampelli","year":"2010","unstructured":"Zampelli, S., Deville, Y., Solnon, C.: Solving subgraph isomorphism problems with constraint programming. Constraints\u00a015(3), 327\u2013353 (2010)","journal-title":"Constraints"},{"issue":"12-13","key":"48_CR19","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1016\/j.artint.2010.05.002","volume":"174","author":"C. Solnon","year":"2010","unstructured":"Solnon, C.: Alldifferent-based filtering for subgraph isomorphism. Artificial Intelligence\u00a0174(12-13), 850\u2013864 (2010)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23786-7_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T16:20:43Z","timestamp":1554135643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23786-7_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237850","9783642237867"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23786-7_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}