{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:36:13Z","timestamp":1725492973440},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749691"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74970-7_51","type":"book-chapter","created":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T23:49:08Z","timestamp":1191973748000},"page":"728-742","source":"Crossref","is-referenced-by-count":7,"title":["Filtering for Subgraph Isomorphism"],"prefix":"10.1007","author":[{"given":"St\u00e9phane","family":"Zampelli","sequence":"first","affiliation":[]},{"given":"Yves","family":"Deville","sequence":"additional","affiliation":[]},{"given":"Christine","family":"Solnon","sequence":"additional","affiliation":[]},{"given":"S\u00e9bastien","family":"Sorlin","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Dupont","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"51_CR1","first-page":"265","volume":"18","author":"D. Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. IJPRAI\u00a018(3), 265\u2013298 (2004)","journal-title":"IJPRAI"},{"key":"51_CR2","volume-title":"Computers and Intractability","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability. Freeman and Co., New York (1979)"},{"issue":"1","key":"51_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J.R. Ullmann","year":"1976","unstructured":"Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM\u00a023(1), 31\u201342 (1976)","journal-title":"J. ACM"},{"key":"51_CR4","unstructured":"Cordella, L., 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, Cuen, pp. 149\u2013159 (2001)"},{"key":"51_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1007\/11564751_74","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"S. Zampelli","year":"2005","unstructured":"Zampelli, S., Deville, Y., Dupont, P.: Approximate constrained subgraph matching. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 832\u2013836. Springer, Heidelberg (2005)"},{"key":"51_CR6","unstructured":"R\u00e9gin, J.: D\u00e9veloppement d\u2019Outils Algorithmiques pour l\u2019Intelligence Artificielle. Application \u00e0 la Chimie Organique. PhD thesis (1995)"},{"key":"51_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/978-3-540-46464-8_17","volume-title":"Theory and Application of Graph Transformations","author":"M. Rudolf","year":"2000","unstructured":"Rudolf, M.: Utilizing constraint satisfaction techniques for efficient graph pattern matching. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol.\u00a01764, pp. 238\u2013252. Springer, Heidelberg (2000)"},{"issue":"4","key":"51_CR8","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1017\/S0960129501003577","volume":"12","author":"J. Larrosa","year":"2002","unstructured":"Larrosa, J., Valiente, G.: Constraint satisfaction algorithms for graph pattern matching. Mathematical. Structures in Comp. Sci.\u00a012(4), 403\u2013422 (2002)","journal-title":"Mathematical. Structures in Comp. Sci."},{"key":"51_CR9","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":"51_CR10","doi-asserted-by":"crossref","unstructured":"Darga, P.T., Liffiton, M.H., Sakallah, K.A., Markov, I.L.: Exploiting structure in symmetry detection for cnf. In: Proc. Design Automation Conference (DAC), pp. 530\u2013534. IEEE\/ACM (2004)","DOI":"10.1145\/996566.996712"},{"key":"51_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/978-3-540-24664-0_20","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"S. Sorlin","year":"2004","unstructured":"Sorlin, S., Solnon, C.: A global constraint for graph isomorphism problems. In: R\u00e9gin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol.\u00a03011, pp. 287\u2013301. Springer, Heidelberg (2004)"},{"key":"51_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"S. Sorlin","year":"2006","unstructured":"Sorlin, S., Solnon, C.: A new filtering algorithm for the graph isomorphism problem. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204. Springer, Heidelberg (2006)"},{"key":"51_CR13","unstructured":"Regin, J.C.: A filtering algorithm for constraints of difference in CSPs. In: Amer. Assoc. Artificial Intelligence. Proc. 12th Conf. American Assoc. Artificial Intelligence, vol.\u00a01, pp. 362\u2013367 (1994)"},{"key":"51_CR14","unstructured":"Zampelli, S., Deville, Y., Solnon, C., Sorlin, S., Dupont, P.: Filtering for subgraph matching. Technical Report INGIRR2007-03, Universit\u00e9 Catholique de Louvain (2007)"},{"issue":"4","key":"51_CR15","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 n\n                    \n                      \n                    \n                    $^{\\mbox{5\/2}}$\n                   algorithm for maximum matchings in bipartite graphs. SIAM J. Comput.\u00a02(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"51_CR16","unstructured":"Barabasi, A.L.: Linked: How Everything Is Connected to Everything Else and What It Means. Plume (2003)"},{"key":"51_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/11564751_18","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"G. Dooms","year":"2005","unstructured":"Dooms, G., Deville, Y., Dupont, P.: Cp(graph): Introducing a graph computation domain in constraint programming. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 211\u2013225. Springer, Heidelberg (2005)"},{"key":"51_CR18","series-title":"Lecture Notes in Computer Science","first-page":"33","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"Y. Deville","year":"2005","unstructured":"Deville, Y., Dooms, G., Zampelli, S., Dupont, P.: Cp(graph+map) for approximate graph matching. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 33\u201348. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74970-7_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:49:23Z","timestamp":1619520563000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74970-7_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749691"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74970-7_51","relation":{},"subject":[]}}