{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:24:28Z","timestamp":1725521068766},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540898115"},{"type":"electronic","value":"9783540898122"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89812-2_6","type":"book-chapter","created":{"date-parts":[[2008,11,18]],"date-time":"2008-11-18T12:12:44Z","timestamp":1227010364000},"page":"76-90","source":"Crossref","is-referenced-by-count":1,"title":["Combining Two Structured Domains for Modeling Various Graph Matching Problems"],"prefix":"10.1007","author":[{"given":"Yves","family":"Deville","sequence":"first","affiliation":[]},{"given":"Gr\u00e9goire","family":"Dooms","sequence":"additional","affiliation":[]},{"given":"St\u00e9phane","family":"Zampelli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_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, 265\u2013298 (2004)","journal-title":"IJPRAI"},{"key":"6_CR2","doi-asserted-by":"crossref","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, 403\u2013422 (2002)","journal-title":"Mathematical Structures in Comp. Sci."},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-540-46464-8_17","volume-title":"Theory and Application of Graph Transformations","author":"M. Rudolf","year":"1998","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\u2013251. Springer, Heidelberg (1998)"},{"key":"6_CR4","first-page":"45","volume":"82","author":"J.T.L. Wang","year":"1995","unstructured":"Wang, J.T.L., Zhang, K., Chirn, G.W.: Algorithms for approximate graph matching. Inf. Sci. Inf. Comput. Sci.\u00a082, 45\u201374 (1995)","journal-title":"Inf. Sci. Inf. Comput. Sci."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1109\/34.682179","volume":"20","author":"B.T. Messmer","year":"1998","unstructured":"Messmer, B.T., Bunke, H.: A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Trans. Pattern Anal. Mach. Intell.\u00a020, 493\u2013504 (1998)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0167-8655(02)00186-1","volume":"24","author":"F. DePiero","year":"2003","unstructured":"DePiero, F., Krout, D.: An algorithm using length-r paths to approximate subgraph isomorphism. Pattern Recogn. Lett.\u00a024, 33\u201346 (2003)","journal-title":"Pattern Recogn. Lett."},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/TPAMI.2005.56","volume":"27-3","author":"A. Robles-Kelly","year":"2005","unstructured":"Robles-Kelly, A., Hancock, E.: Graph edit distance from spectral seriation. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a027-3, 365\u2013378 (2005)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"6_CR8","first-page":"112","volume":"2","author":"R. Giugno","year":"2002","unstructured":"Giugno, R., Shasha, D.: Graphgrep: A fast and universal method for querying graphs. ICPR\u00a02, 112\u2013115 (2002)","journal-title":"ICPR"},{"key":"6_CR9","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.E.: Approximate Constrained Subgraph Matching. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 832\u2013836. Springer, Heidelberg (2005)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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\u2013302. Springer, Heidelberg (2004)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10601-004-5306-8","volume":"10","author":"J.F. Puget","year":"2005","unstructured":"Puget, J.F.: Symmetry breaking revisited. Constraints\u00a010, 23\u201346 (2005)","journal-title":"Constraints"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-540-30201-8_30","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"N. Mamoulis","year":"2004","unstructured":"Mamoulis, N., Stergiou, K.: Constraint satisfaction in semi-structured data graphs. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 393\u2013407. Springer, Heidelberg (2004)"},{"key":"6_CR13","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.E.: 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":"6_CR14","unstructured":"Gervet, C.: New structures of symbolic constraint objects: sets and graphs. In: Third Workshop on Constraint Logic Programming (WCLP 1993), Marseille (1993)"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/B:ANOR.0000032577.81139.84","volume":"130","author":"A. Chabrier","year":"2004","unstructured":"Chabrier, A., Danna, E., Pape, C.L., Perron, L.: Solving a network design problem. Annals of Operations Research\u00a0130, 217\u2013239 (2004)","journal-title":"Annals of Operations Research"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF00137870","volume":"1","author":"C. Gervet","year":"1997","unstructured":"Gervet, C.: Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints\u00a01, 191\u2013244 (1997)","journal-title":"Constraints"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-45241-9_16","volume-title":"Practical Aspects of Declarative Languages","author":"P. Flener","year":"2001","unstructured":"Flener, P., Hnich, B., Kiziltan, Z.: Compiling high-level type constructors in constraint programming. In: Ramakrishnan, I.V. (ed.) PADL 2001. LNCS, vol.\u00a01990, pp. 229\u2013244. Springer, Heidelberg (2001)"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"12","author":"N. Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., Contjean, E.: Introducing global constraints in CHIP. Mathematical and Computer Modelling\u00a012, 97\u2013123 (1994)","journal-title":"Mathematical and Computer Modelling"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1287\/trsc.32.1.12","volume":"32","author":"G. Pesant","year":"1996","unstructured":"Pesant, G., Gendreau, M., Potvin, J., Rousseau, J.: An exact constraint logic programming algorithm for the travelling salesman with time windows. Transportation Science\u00a032, 12\u201329 (1996)","journal-title":"Transportation Science"},{"key":"6_CR20","unstructured":"Puget, J.F.: Pecos a high level constraint programming language. In: Proceedings of Spicis 1992 (1992)"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/11493853_7","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"N. Beldiceanu","year":"2005","unstructured":"Beldiceanu, N., Flener, P., Lorca, X.: The tree constraint. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol.\u00a03524, pp. 64\u201378. Springer, Heidelberg (2005)"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/978-3-540-45193-8_47","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"M. Sellmann","year":"2003","unstructured":"Sellmann, M.: Cost-based filtering for shorter path constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 694\u2013708. Springer, Heidelberg (2003)"},{"key":"6_CR23","unstructured":"Cambazard, H., Bourreau, E.: Conception d\u2019une contrainte globale de chemin. In: 10e Journ\u00e9es nationales sur la r\u00e9solution pratique de problFmes NP-complets (JNPC 2004), pp. 107\u2013121 (2004)"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/11889205_13","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"G. Dooms","year":"2006","unstructured":"Dooms, G., Katriel, I.: The Minimum Spanning Tree Constraint. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 152\u2013166. Springer, Heidelberg (2006)"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72397-4_5","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"G. Dooms","year":"2007","unstructured":"Dooms, G., Katriel, I.: The \u201cnot-too-heavy\u201d spanning tree constraint. In: Van Hentenryck, P., Wolsey, L.A. (eds.) CPAIOR 2007. LNCS, vol.\u00a04510. Springer, Heidelberg (2007)"},{"key":"6_CR26","unstructured":"Hnich, B.: Function variables for Constraint Programming. PhD thesis, Uppsala University, Department of Information Science (2003)"},{"key":"6_CR27","unstructured":"Frisch, A.M., Jefferson, C., Hernandez, B.M., Miguel, I.: The rules of constraint modelling. In: Proceedings of IJCAI 2005 (2005)"},{"key":"6_CR28","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0004-3702(78)90029-2","volume":"10","author":"J.L. Lauriere","year":"1978","unstructured":"Lauriere, J.L.: A language and a program for stating and solving combinatorial problems. Artificial Intelligence\u00a010, 29\u2013128 (1978)","journal-title":"Artificial Intelligence"},{"key":"6_CR29","unstructured":"Smith, D.: Structure and design of global search algorithms. Technical Report Tech. Report KES.U.87.12, Kestrel Institute, Palo Alto, Calif (1987)"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-49201-1_2","volume-title":"Practical Aspects of Declarative Languages","author":"M. Cadoli","year":"1999","unstructured":"Cadoli, M., Palopoli, L., Schaerf, A., Vasile, D.: NP-SPEC: An executable specification language for solving all problems in NP. In: Gupta, G. (ed.) PADL 1999. LNCS, vol.\u00a01551, pp. 16\u201330. Springer, Heidelberg (1999)"},{"key":"6_CR31","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s10601-006-9012-6","volume":"12","author":"F. Azevedo","year":"2007","unstructured":"Azevedo, F.: Cardinal: A finite sets constraint solver. Constraints\u00a012, 93\u2013129 (2007)","journal-title":"Constraints"},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N.: Global constraints as graph properties on structured network of elementary constraints of the same type. Technical Report T2000\/01, SICS (2000)","DOI":"10.1007\/3-540-45349-0_6"},{"key":"6_CR33","unstructured":"Thiel, S.: Efficient Algorithms for Constraint Propagation and for Processing Tree Descriptions. PhD thesis, University of Saarbrucken (2004)"},{"key":"6_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/11493853_8","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"C. Bessi\u00e8re","year":"2005","unstructured":"Bessi\u00e8re, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: Filtering algorithms for the nvalue constraint. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol.\u00a03524, pp. 79\u201393. Springer, Heidelberg (2005)"},{"key":"6_CR35","unstructured":"Bessi\u00e8re, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: The range and roots constraints: Specifying counting and occurrence problems. In: IJCAI, pp. 60\u201365 (2005)"},{"key":"6_CR36","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":"6_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1007\/978-3-540-74970-7_51","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"S. Zampelli","year":"2007","unstructured":"Zampelli, S., Deville, Y., Solnon, C., Sorlin, S., Dupont, P.E.: Filtering for Subgraph Isomorphism. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 728\u2013742. Springer, Heidelberg (2007)"},{"key":"6_CR38","unstructured":"Foggia, P., Sansone, C., Vento, M.: An improved algorithm for matching large graphs. In: ed. 3rd IAPR-TC15 Workshop on Graph-based Representations. (2001), http:\/\/amalfi.dis.unina.it\/graph\/db\/vflib2.0\/doc\/vflib.html"},{"key":"6_CR39","first-page":"1172","volume-title":"ICIAP","author":"L.P. Cordella","year":"1999","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: Performance evaluation of the vf graph matching algorithm. In: ICIAP, pp. 1172\u20131177. IEEE Computer Society, Los Alamitos (1999)"},{"key":"6_CR40","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, 31\u201342 (1976)","journal-title":"J. ACM"},{"key":"6_CR41","volume-title":"The Stanford GraphBase. A Platform for Combinatorial Computing","author":"D.E. Knuth","year":"1993","unstructured":"Knuth, D.E.: The Stanford GraphBase. A Platform for Combinatorial Computing. ACM Press, New York (1993)"},{"key":"6_CR42","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1109\/TKDE.2003.1209024","volume":"15","author":"A. Dovier","year":"2003","unstructured":"Dovier, A., Piazza, C.: The subgraph bisimulation problem. IEEE Transaction on Knowledge and Data Engineering\u00a015, 1055\u20131056 (2003)","journal-title":"IEEE Transaction on Knowledge and Data Engineering"}],"container-title":["Lecture Notes in Computer Science","Recent Advances in Constraints"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89812-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:31:40Z","timestamp":1557930700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89812-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540898115","9783540898122"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89812-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}