{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T01:35:05Z","timestamp":1725672905701},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642290374"},{"type":"electronic","value":"9783642290381"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29038-1_33","type":"book-chapter","created":{"date-parts":[[2012,4,5]],"date-time":"2012-04-05T07:57:38Z","timestamp":1333612658000},"page":"455-469","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Subgraph Similarity All-Matching"],"prefix":"10.1007","author":[{"given":"Gaoping","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Ke","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Chuan","family":"Xiao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Bunke, H., Foggia, P., Guidobaldi, C., Sansone, C., Vento, M.: A comparison of algorithms for maximum common subgraph on randomly connected graphs. In: SSPR\/SPR, pp. 123\u2013132 (2002)","DOI":"10.1007\/3-540-70659-3_12"},{"key":"33_CR2","unstructured":"Chen, C., Yan, X., Yu, P.S., Han, J., Zhang, D.-Q., Gu, X.: Towards graph containment search and indexing. In: VLDB, pp. 926\u2013937 (2007)"},{"key":"33_CR3","unstructured":"Cordella, L., Foggia, P., Sansone, C., Vento, M.: An improved algorithm for matching large graphs. In: 3rd Workshop on Graph-based Representations in Pattern Recognition, pp. 149\u2013159 (2001)"},{"key":"33_CR4","unstructured":"He, H., Singh, A.K.: Closure-tree: An index structure for graph queries. In: ICDE, p. 38 (2006)"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Jiang, H., Wang, H., Yu, P.S., Zhou, S.: Gstring: A novel approach for efficient search in graph databases. In: ICDE, pp. 566\u2013575 (2007)","DOI":"10.1109\/ICDE.2007.367902"},{"issue":"6","key":"33_CR6","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1002\/spe.588","volume":"34","author":"E.B. Krissinel","year":"2004","unstructured":"Krissinel, E.B., Henrick, K.: Common subgraph isomorphism detection by backtracking search. Softw. Pract. Exper.\u00a034(6), 591\u2013607 (2004)","journal-title":"Softw. Pract. Exper."},{"issue":"1","key":"33_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/spe.4380120103","volume":"12","author":"J.J. McGregor","year":"1982","unstructured":"McGregor, J.J.: Backtrack search algorithms and the maximal common subgraph problem. Softw. Pract. Exper.\u00a012(1), 23\u201334 (1982)","journal-title":"Softw. Pract. Exper."},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Shang, H., Lin, X., Zhang, Y., Yu, J.X., Wang, W.: Connected substructure similarity search. In: SIGMOD, pp. 903\u2013914 (2010)","DOI":"10.1145\/1807167.1807264"},{"issue":"1","key":"33_CR9","first-page":"364","volume":"1","author":"H. Shang","year":"2008","unstructured":"Shang, H., Zhang, Y., Lin, X., Yu, J.X.: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. PVLDB\u00a01(1), 364\u2013375 (2008)","journal-title":"PVLDB"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Shasha, D., Wang, J.T.-L., Giugno, R.: Algorithmics and applications of tree and graph searching. In: PODS, pp. 39\u201352 (2002)","DOI":"10.1145\/543613.543620"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Tian, Y., Patel, J.M.: Tale: A tool for approximate large graph matching. In: ICDE, pp. 963\u2013972 (2008)","DOI":"10.1109\/ICDE.2008.4497505"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, P.S.Y.J.: Substructure similarity search in graph databases. In: SIGMOD, pp. 766\u2013777 (2005)","DOI":"10.1145\/1066157.1066244"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph indexing: A frequent structure-based approach. In: SIGMOD Conference, pp. 335\u2013346 (2004)","DOI":"10.1145\/1007568.1007607"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Zhang, S., Hu, M., Yang, J.: Treepi: A novel graph indexing method. In: ICDE, pp. 966\u2013975 (2007)","DOI":"10.1109\/ICDE.2007.368955"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Zhang, S., Li, J., Gao, H., Zou, Z.: A novel approach for efficient supergraph query processing on graph databases. In: EDBT, pp. 204\u2013215 (2009)","DOI":"10.1145\/1516360.1516385"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Zhang, S., Li, S., Yang, J.: Gaddi: distance index based subgraph matching in biological networks. In: EDBT, pp. 192\u2013203 (2009)","DOI":"10.1145\/1516360.1516384"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Zhang, S., Yang, J., Jin, W.: Sapper: Subgraph indexing and approximate matching in large graphs. In: VLDB (2010)","DOI":"10.14778\/1920841.1920988"},{"issue":"1","key":"33_CR18","first-page":"340","volume":"3","author":"P. Zhao","year":"2010","unstructured":"Zhao, P., Han, J.: On graph query optimization in large networks. PVLDB\u00a03(1), 340\u2013351 (2010)","journal-title":"PVLDB"},{"key":"33_CR19","unstructured":"Zhao, P., Yu, J.X., Yu, P.S.: Graph Indexing: Tree + Delta >= Graph. In: VLDB, pp. 938\u2013949 (2007)"},{"key":"33_CR20","doi-asserted-by":"crossref","unstructured":"Zou, L., Chen, L., Yu, J.X., Lu, Y.: A novel spectral coding in a large graph database. In: EDBT, pp. 181\u2013192 (2008)","DOI":"10.1145\/1352431.1352457"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29038-1_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:19:52Z","timestamp":1620127192000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29038-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642290374","9783642290381"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29038-1_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}