{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:21:24Z","timestamp":1725567684147},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540218364"},{"type":"electronic","value":"9783540246640"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24664-0_20","type":"book-chapter","created":{"date-parts":[[2010,10,23]],"date-time":"2010-10-23T10:59:59Z","timestamp":1287831599000},"page":"287-301","source":"Crossref","is-referenced-by-count":12,"title":["A Global Constraint for Graph Isomorphism Problems"],"prefix":"10.1007","author":[{"given":"S\u00e9bastien","family":"Sorlin","sequence":"first","affiliation":[]},{"given":"Christine","family":"Solnon","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Aggoun, A., Beldiceanu, N.: Extending CHIP in order to solve complex and scheduling and placement problems. In: Actes des Journ\u00e9es Francophones de Programmation et Logique, Lille, France (1992)","DOI":"10.1016\/0895-7177(93)90068-A"},{"key":"20_CR2","volume-title":"The design and analysis of computer algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Addison Wesley, Reading (1974)"},{"key":"20_CR3","first-page":"108","volume-title":"Proceedings of the 11th National Conference on Artificial Intelligence","author":"C. Bessi\u00e8re","year":"1993","unstructured":"Bessi\u00e8re, C., Cordier, M.-O.: Arc-consistency and arc-consistency again. In: Proceedings of the 11th National Conference on Artificial Intelligence, July 1993, pp. 108\u2013113. AAAI Press, Menlo Park (1993)"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/978-3-540-45193-8_54","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"C. Bessi\u00e8re","year":"2003","unstructured":"Bessi\u00e8re, C., Van Hentenryck, P.: To be or not to be.. a global constraint. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 789\u2013794. Springer, Heidelberg (2003)"},{"key":"20_CR5","first-page":"309","volume-title":"Proceedings of the seventeenth International Conference on Artificial Intelligence (IJCAI 2001)","author":"C. Bessi\u00e8re","year":"2001","unstructured":"Bessi\u00e8re, C., R\u00e9gin Refining, J.-C.: the basic constraint propagation algorithm. In: Nebel, B. (ed.) Proceedings of the seventeenth International Conference on Artificial Intelligence (IJCAI 2001), August 4-10, pp. 309\u2013315. Morgan Kaufmann Publishers, Inc., San Francisco (2001)"},{"key":"20_CR6","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-45006-8_9","volume-title":"Case-Based Reasoning Research and Development","author":"P.-A. Champin","year":"2003","unstructured":"Champin, P.-A., Solnon, C.: Measuring the similarity of labeled graphs. In: Ashley, K.D., Bridge, D.G. (eds.) ICCBR 2003. LNCS (LNAI), vol.\u00a02689, pp. 80\u201395. Springer, Heidelberg (2003)"},{"key":"20_CR7","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: An improved algorithm for matching large graphs. In: 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pp. 149\u2013159. Cuen (2001)"},{"key":"20_CR8","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"key":"20_CR9","unstructured":"Foggia, P., Sansone, C., Vento, M.: A performance comparison of five algorithms for graph isomorphism. In: 3rd IAPR-TC15 Workshop on Graphbased Representations in Pattern Recognition, pp. 188\u2013199. Cuen (2001)"},{"key":"20_CR10","unstructured":"Fortin, S.: The graph isomorphism problem. Technical report, Dept of Computing Science, Univ. Alberta, Edmonton, Alberta, Canada (1996)"},{"key":"20_CR11","volume-title":"Computers and Intractability : A Guide to The Theory of NP-Completness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability : A Guide to The Theory of NP-Completness. W.H. Freeman, San Francisco (1979)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Wong, J.-K.: Linear time algorithm for isomorphism of planar graphs. In: 6th Annu. ACM Symp. theory of Comput., pp. 172\u2013184 (1974)","DOI":"10.1145\/800119.803896"},{"key":"20_CR13","unstructured":"ILOG,S.A. ILOG Solver 5.0 User\u2019s Manual and Reference Manual (2000)"},{"key":"20_CR14","unstructured":"Laburthe, F., and the OCRE project team: CHOCO: implementing a CP kernel. In: Proc. of the CP 2000 workshop on techniques for implementing constraint programming systems, Singapore (2000)"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Luks, E.M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. Journal of Computer System Science, 42\u201365 (1982)","DOI":"10.1016\/0022-0000(82)90009-5"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0255(79)90023-9","volume":"19","author":"J.J. McGregor","year":"1979","unstructured":"McGregor, J.J.: Relational consistency algorithms and their applications in finding subgraph and graph isomorphisms. Information Science\u00a019, 229\u2013250 (1979)","journal-title":"Information Science"},{"key":"20_CR17","first-page":"45","volume":"30","author":"B.D. McKay","year":"1981","unstructured":"McKay, B.D.: Practical graph isomorphism. Congressus Numerantium\u00a030, 45\u201387 (1981)","journal-title":"Congressus Numerantium"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0004-3702(86)90083-4","volume":"28","author":"R. Mohr","year":"1986","unstructured":"Mohr, R., Henderson, T.C.: Arc and path consistency revisited. Artificial Intelligence\u00a028, 65\u201374 (1986)","journal-title":"Artificial Intelligence"},{"key":"20_CR19","unstructured":"R\u00e9gin, J.-C.: D\u00e9veloppement d\u2019Outils Algorithmiques pour l\u2019Intelligence Artificielle. Application \u00e1 la Chimie Organique. PhD thesis, Univ. Montpellier II (1995)"},{"key":"20_CR20","volume-title":"Foundations of Constraint Satisfaction","author":"E. Tsang","year":"1993","unstructured":"Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1993)"},{"issue":"1","key":"20_CR21","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J.D. Ullman","year":"1976","unstructured":"Ullman, J.D.: An algorithm for subgraph isomorphism. Journal of the Association of Computing Machinery\u00a023(1), 31\u201342 (1976)","journal-title":"Journal of the Association of Computing Machinery"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24664-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,12]],"date-time":"2021-11-12T10:18:17Z","timestamp":1636712297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24664-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540218364","9783540246640"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24664-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}