{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T07:45:41Z","timestamp":1715240741569},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,3,29]],"date-time":"2008-03-29T00:00:00Z","timestamp":1206748800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,3,29]],"date-time":"2008-03-29T00:00:00Z","timestamp":1206748800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s10601-008-9044-1","type":"journal-article","created":{"date-parts":[[2008,3,28]],"date-time":"2008-03-28T20:32:53Z","timestamp":1206736373000},"page":"518-537","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["A parametric filtering algorithm for the graph isomorphism problem"],"prefix":"10.1007","volume":"13","author":[{"given":"S\u00e9bastien","family":"Sorlin","sequence":"first","affiliation":[]},{"given":"Christine","family":"Solnon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,3,29]]},"reference":[{"key":"9044_CR1","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. (1974). The design and analysis of computer algorithms. Redwood City: Addison Wesley."},{"key":"9044_CR2","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":"9044_CR3","first-page":"789","volume-title":"CP\u201903. Kinsale, Ireland","author":"C. Bessi\u00e8re","year":"2003","unstructured":"Bessi\u00e8re, C., & Van Hentenryck, P. (2003). To be or not to be. A global constraint. In CP\u201903. Kinsale, Ireland (pp. 789\u2013794). New York: Springer."},{"key":"9044_CR4","first-page":"80","volume-title":"5th International conference on case-based reasoning (ICCBR 2003). Lecture notes in artificial intelligence (Vol. 2689)","author":"P.-A. Champin","year":"2003","unstructured":"Champin, P.-A., & Solnon, C. (2003). Measuring the similarity of labeled graphs. In 5th International conference on case-based reasoning (ICCBR 2003). Lecture notes in artificial intelligence (Vol. 2689, pp. 80\u201395). New York: Springer."},{"issue":"10","key":"9044_CR5","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"L. P. Cordella","year":"2004","unstructured":"Cordella, L. P., Foggia, P., Sansone, C., & Vento, M. (2004). A (sub)graph isomorphism algorithm for matching large graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(10), 1367\u20131372.","journal-title":"Transactions on Pattern Analysis and Machine Intelligence"},{"key":"9044_CR6","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1145\/996566.996712","volume-title":"DAC","author":"P. T. 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 DAC (pp. 530\u2013554). Piscataway: IEEE."},{"key":"9044_CR7","unstructured":"Foggia, P., Sansone, C., & Vento, M. (2001). A performance comparison of five algorithms for graph isomorphism. In 3rd IAPR-TC15 workshop on graph-based representations in pattern recognition (pp. 188\u2013199). Cuen."},{"key":"9044_CR8","unstructured":"Fortin, S. (1996). The graph isomorphism problem. Technical report, Dept. of Computing Science, Univ. Alberta, Edmonton, Alberta, Canada."},{"key":"9044_CR9","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. (1979). Computers and intractability : A guide to the theory of NP-completness. San Francisco: W. H. Freeman."},{"key":"9044_CR10","doi-asserted-by":"crossref","unstructured":"Hopcroft, J. E., & Wong, J.-K. (1974). Linear time algorithm for isomorphism of planar graphs. In 6\n                    th\n                  \n                           annual ACM symposium on the theory of computing (pp. 172\u2013184).","DOI":"10.1145\/800119.803896"},{"key":"9044_CR11","unstructured":"ILOG, S. A. (2000). ILOG Solver 5.0 user\u2019s manual and reference manual."},{"key":"9044_CR12","unstructured":"Laburthe, F., & OCRE (2000). CHOCO: Implementing a CP kernel. In Proc. of the CP\u20192000 workshop on techniques for implementing constraint programming systems. Singapore."},{"key":"9044_CR13","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"E. M. Luks","year":"1982","unstructured":"Luks, E. M. (1982). Isomorphism of graphs of bounded valence can be tested in polynomial time. Journal of Computer System Science, 25, 42\u201365.","journal-title":"Journal of Computer System Science"},{"key":"9044_CR14","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. (1979). Relational con sistency algorithms and their applications in finding subgraph and graph isomorphisms. Information Science, 19, 229\u2013250.","journal-title":"Information Science"},{"key":"9044_CR15","first-page":"45","volume":"30","author":"B. D. McKay","year":"1981","unstructured":"McKay, B. D. (1981). Practical graph isomorphism. Congressus Numerantium, 30, 45\u201387.","journal-title":"Congressus Numerantium"},{"key":"9044_CR16","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/11564751_36","volume":"3709","author":"J.-F. Puget","year":"2005","unstructured":"Puget, J.-F. (2005). Automatic detection of variable and value symmetries. Principles and practice of constraint programming - CP 2005, 3709, 475\u2013489.","journal-title":"Principles and practice of constraint programming - CP 2005"},{"key":"9044_CR17","unstructured":"R\u00e9gin, J.-C. (1995). D\u00e9veloppement d\u2019Outils Algorithmiques pour l\u2019Intelligence Artificielle. Application \u00e0 la Chimie Organique. Ph.D. thesis, Univ. Montpellier II."},{"issue":"3","key":"9044_CR18","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1145\/321958.321963","volume":"23","author":"D. Schmidt","year":"1976","unstructured":"Schmidt, D., & Druffel, L. (1976). A fast backtracking algorithm to test directed graphs for isomorphism using distance matrices. Journal of the ACM (JACM), 23(3), 433\u2013445.","journal-title":"Journal of the ACM (JACM)"},{"key":"9044_CR19","first-page":"287","volume-title":"The 6th international conference on integration of AI and OR techniques in constraint programming for combinatorial optimisation problems (CP-AI-OR 2004), number 3011 in LNCS","author":"S. Sorlin","year":"2004","unstructured":"Sorlin, S., & Solnon, C. (2004). A global constraint for graph isomorphism problems. In The 6th international conference on integration of AI and OR techniques in constraint programming for combinatorial optimisation problems (CP-AI-OR 2004), number 3011 in LNCS (pp. 287\u2013301). Avril: Springer."},{"key":"9044_CR20","first-page":"103","volume-title":"Trends in constraint programming","author":"S. Sorlin","year":"2007","unstructured":"Sorlin, S., & Solnon, C. (2007). A new filtering algorithm for the graph isomorphism problem. Constraint propagation and implementation. In F. Benhamou, N. Jussien, & B. O\u2019Sullivan (Eds.), Trends in constraint programming (pp. 103\u2013107). Washington, DC: ISTE."},{"key":"9044_CR21","volume-title":"Foundations of constraint satisfaction","author":"E. Tsang","year":"1993","unstructured":"Tsang, E. (1993). Foundations of constraint satisfaction. London: Academic."},{"issue":"1","key":"9044_CR22","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J. D. Ullman","year":"1976","unstructured":"Ullman, J. D. (1976). An algorithm for subgraph isomorphism. Journal of the Association of Computing Machinery, 23(1), 31\u201342.","journal-title":"Journal of the Association of Computing Machinery"},{"issue":"1\u20133","key":"9044_CR23","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0004-3702(92)90006-J","volume":"58","author":"P. Van Hentenryck","year":"1992","unstructured":"Van Hentenryck, P., Simonis, H., & Dincbas, M. (1992). Constraint satisfaction using constraint logic programming. Artificial Intelligence, 58(1\u20133), 113\u2013159.","journal-title":"Artificial Intelligence"},{"key":"9044_CR24","unstructured":"Zampelli, S., Deville, Y., & Dupont, P. (2006). Elimination des sym\u00e9tries pour l\u2019appariement de graphes. In L. Henocque (Ed.), JFPC\u201906, Deuxi\u00e8mes Journ\u00e9es Francophones de Programmation par Contraintes (pp. 357\u2013367)."},{"key":"9044_CR25","first-page":"728","volume-title":"Principles and practice of constraint programming (CP\u20192007), number 4741 in LNCS","author":"S. Zampelli","year":"2007","unstructured":"Zampelli, S., Deville, Y., Solnon, C., Sorlin, S., & Dupont, P. (2007). Filtering for subgraph isomorphism. In Principles and practice of constraint programming (CP\u20192007), number 4741 in LNCS (pp. 728\u2013742). New York: Springer."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-008-9044-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10601-008-9044-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-008-9044-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-008-9044-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T00:34:07Z","timestamp":1652661247000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10601-008-9044-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,29]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["9044"],"URL":"https:\/\/doi.org\/10.1007\/s10601-008-9044-1","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3,29]]},"assertion":[{"value":"2 October 2007","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2008","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2008","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}