{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T06:49:58Z","timestamp":1763016598723},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292388"},{"type":"electronic","value":"9783540320500"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11564751_74","type":"book-chapter","created":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T09:31:28Z","timestamp":1129627888000},"page":"832-836","source":"Crossref","is-referenced-by-count":10,"title":["Approximate Constrained Subgraph Matching"],"prefix":"10.1007","author":[{"given":"St\u00e9phane","family":"Zampelli","sequence":"first","affiliation":[]},{"given":"Yves","family":"Deville","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Dupont","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"74_CR1","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":"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\u2013251. Springer, Heidelberg (2000)"},{"issue":"4","key":"74_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(4), 403\u2013422 (2002)","journal-title":"Mathematical. Structures in Comp. Sci."},{"key":"74_CR3","unstructured":"Regin, J.C.: A filtering algorithm for constraints of difference in CSPs. In: Proc. 12th Conf. American Assoc. Artificial Intelligence, vol.\u00a01, pp. 362\u2013367 (1994)"},{"key":"74_CR4","unstructured":"van Hoeve, W.J.: The alldifferent constraint: A survey. CoRR cs.PL\/0105015 (2001)"},{"key":"74_CR5","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)"},{"issue":"1","key":"74_CR6","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":"74_CR7","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":"74_CR8","unstructured":"Foggia, P., Sansone, C., Vento, M.: A database of graphs for isomorphism and sub-graph isomorphism benchmarcking. CoRR cs.PL\/0105015 (2001)"},{"key":"74_CR9","series-title":"A Platform for Combinatorial Computing","volume-title":"The Stanford GraphBase","author":"D.E. Knuth","year":"1993","unstructured":"Knuth, D.E.: The Stanford GraphBase. A Platform for Combinatorial Computing. ACM Press, New York (1993)"},{"key":"74_CR10","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.: Cp(graph): Introducing a graph computation domain in constraint programming (accepted paper). In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 211\u2013225. Springer, Heidelberg (2005)"},{"key":"74_CR11","unstructured":"Deville, Y., Dooms, G., Zampelli, S., Dupont, P.: Cp(graph+map) for approximate graph matching. In: 1st International Workshop on Constraint Programming Beyond Finite Integer Domains, CP 2005 (2005) (submitted paper)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11564751_74","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T08:09:41Z","timestamp":1554106181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11564751_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292388","9783540320500"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11564751_74","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}