{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:10:02Z","timestamp":1748459402203,"version":"3.41.0"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319182230"},{"type":"electronic","value":"9783319182247"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18224-7_13","type":"book-chapter","created":{"date-parts":[[2015,5,4]],"date-time":"2015-05-04T16:48:35Z","timestamp":1430758115000},"page":"128-137","source":"Crossref","is-referenced-by-count":0,"title":["GEM++: A Tool for Solving Substitution-Tolerant Subgraph Isomorphism"],"prefix":"10.1007","author":[{"given":"Julien","family":"Lerouge","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Le Bodic","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"H\u00e9roux","sequence":"additional","affiliation":[]},{"given":"S\u00e9bastien","family":"Adam","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: Performance evaluation of the VF graph matching algorithm. In: Proc. of the Int\u2019l Conf. on Image Analys. and Proc., pp. 1172\u20131177 (1999)","DOI":"10.1109\/ICIAP.1999.797762"},{"issue":"10","key":"13_CR2","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.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. on PAMI\u00a026(10), 1367\u20131372 (2004)","journal-title":"IEEE Trans. on PAMI"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-72792-7_22","volume-title":"Integer Programming and Combinatorial Optimization","author":"E. Danna","year":"2007","unstructured":"Danna, E., Fenelon, M., Gu, Z., Wunderling, R.: Generating multiple solutions for mixed integer programming problems. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol.\u00a04513, pp. 280\u2013294. Springer, Heidelberg (2007)"},{"issue":"8","key":"13_CR4","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1016\/S0167-8655(02)00253-2","volume":"24","author":"M. De Santo","year":"2003","unstructured":"De Santo, M., Foggia, P., Sansone, C., Vento, M.: A large database of graphs and its use for benchmarking graph isomorphism algorithms. Pattern Recogn. Lett.\u00a024(8), 1067\u20131079 (2003)","journal-title":"Pattern Recogn. Lett."},{"key":"13_CR5","first-page":"290","volume":"6","author":"P. Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On random graphs. Public. Mathemat.\u00a06, 290\u2013297 (1959)","journal-title":"Public. Mathemat."},{"key":"13_CR6","unstructured":"Foggia, P., Sansone, C., Vento, M.: A database of graphs for isomorphism and sub-graph isomorphism benchmarking. In: Proc. Third IAPR TC-15 Int\u2019l Workshop Graph Based Representations, pp. 176\u2013187 (2001)"},{"key":"13_CR7","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman & Co. (1979)"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/TSMC.1980.4308468","volume":"10","author":"D.E. Ghahraman","year":"1980","unstructured":"Ghahraman, D.E., Wong, A.K.C., Au, T.: Graph optimal monomorphism algorithms. IEEE Transactions on System, Man and Cybernetics\u00a010, 181\u2013188 (1980)","journal-title":"IEEE Transactions on System, Man and Cybernetics"},{"issue":"12","key":"13_CR9","doi-asserted-by":"publisher","first-page":"4214","DOI":"10.1016\/j.patcog.2012.05.022","volume":"45","author":"P. Le Bodic","year":"2012","unstructured":"Le Bodic, P., H\u00e9roux, P., Adam, S., Lecourtier, Y.: An integer linear program for substitution-tolerant subgraph isomorphism and its use for symbol spotting in technical drawings. Pattern Recognition\u00a045(12), 4214\u20134224 (2012)","journal-title":"Pattern Recognition"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Le Bodic, P., Locteau, H., Adam, S., H\u00e9roux, P., Lecourtier, Y., Knippel, A.: Symbol detection using region adjacency graphs and integer linear programming. In: Proc. of the Int\u2019l Conf. on Doc. Analys. and Recog., pp. 1320\u20131324 (2009)","DOI":"10.1109\/ICDAR.2009.202"},{"issue":"12-13","key":"13_CR11","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1016\/j.artint.2010.05.002","volume":"174","author":"C. Solnon","year":"2010","unstructured":"Solnon, C.: Alldifferent-based filtering for subgraph isomorphism. Artificial Intelligence\u00a0174(12-13), 850\u2013864 (2010)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"13_CR12","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"},{"issue":"3","key":"13_CR13","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1109\/21.57275","volume":"20","author":"A.K.C. Wong","year":"1990","unstructured":"Wong, A.K.C., You, M., Chan, S.C.: An algorithm for graph optimal monomorphism. IEEE Transactions on System, Man and Cybernetics\u00a020(3), 628\u2013638 (1990)","journal-title":"IEEE Transactions on System, Man and Cybernetics"}],"container-title":["Lecture Notes in Computer Science","Graph-Based Representations in Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18224-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T19:59:12Z","timestamp":1748375952000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18224-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319182230","9783319182247"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18224-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}