{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T05:27:40Z","timestamp":1770528460646,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T00:00:00Z","timestamp":1467676800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T00:00:00Z","timestamp":1467676800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.springer.com\/tdm"}],"funder":[{"name":"FFK039","award":["Idaho National Laboratory"],"award-info":[{"award-number":["Idaho National Laboratory"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DRL-1515550"],"award-info":[{"award-number":["DRL-1515550"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s10115-016-0968-2","type":"journal-article","created":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T16:26:55Z","timestamp":1467736015000},"page":"61-87","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":39,"title":["Efficient and scalable labeled subgraph matching using SGMatch"],"prefix":"10.1007","volume":"51","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-5770-950X","authenticated-orcid":false,"given":"Carlos R.","family":"Rivero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-3124-3780","authenticated-orcid":false,"given":"Hasan M.","family":"Jamil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,5]]},"reference":[{"issue":"6","key":"968_CR1","doi-asserted-by":"publisher","first-page":"1790","DOI":"10.1109\/TCBB.2012.90","volume":"9","author":"MS Amin","year":"2012","unstructured":"Amin MS, Finley RL, Jamil HM (2012) Top-k similar graph matching using TraM in biological networks. IEEE\/ACM Trans Comput Biol Bioinform 9(6):1790\u20131804","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"issue":"S\u20137","key":"968_CR2","doi-asserted-by":"publisher","first-page":"S13","DOI":"10.1186\/1471-2105-14-S7-S13","volume":"14","author":"V Bonnici","year":"2013","unstructured":"Bonnici V, Giugno R, Pulvirenti A, Shasha D, Ferro A (2013) A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinform 14(S\u20137):S13","journal-title":"BMC Bioinform"},{"issue":"10","key":"968_CR3","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella LP, Foggia P, Sansone C, Vento M (2004) A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans Pattern Anal Mach Intell 26(10):1367\u20131372","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"968_CR4","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, San Francisco"},{"key":"968_CR5","unstructured":"Han W-S, Lee J, Lee J-H (2013) Turbo$$_{{\\rm iso}}$$: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: SIGMOD conference, pp 337\u2013348"},{"key":"968_CR6","unstructured":"He H, Singh AK (2006) Closure-tree: an index structure for graph queries. In: ICDE, p 38"},{"key":"968_CR7","doi-asserted-by":"crossref","unstructured":"He H, Singh AK(2008) Graphs-at-a-time: query language and access methods for graph databases. In: SIGMOD conference, pp 405\u2013418","DOI":"10.1145\/1376616.1376660"},{"key":"968_CR8","doi-asserted-by":"crossref","unstructured":"Jamil HM (2009) A novel knowledge representation framework for computing sub-graph isomorphic queries in interaction network databases. In ICTAI, pp 131\u2013138","DOI":"10.1109\/ICTAI.2009.123"},{"key":"968_CR9","doi-asserted-by":"crossref","unstructured":"Jamil HM (2011) Computing subgraph isomorphic queries using structural unification and minimum graph structures. In SAC, pp 1053\u20131058","DOI":"10.1145\/1982185.1982415"},{"issue":"2","key":"968_CR10","first-page":"133","volume":"6","author":"J Lee","year":"2012","unstructured":"Lee J, Han W-S, Kasperovics R, Lee J-H (2012) An in-depth comparison of subgraph isomorphism algorithms in graph databases. PVLDB 6(2):133\u2013144","journal-title":"PVLDB"},{"key":"968_CR11","unstructured":"Leskovec J (2016) Stanford large network dataset collection. \n                    https:\/\/2.zoppoz.workers.dev:443\/http\/snap.stanford.edu\/data\/index.html"},{"issue":"2","key":"968_CR12","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1109\/69.842269","volume":"12","author":"BT Messmer","year":"2000","unstructured":"Messmer BT, Bunke H (2000) Efficient subgraph isomorphism detection: a decomposition approach. IEEE Trans Knowl Data Eng 12(2):307\u2013323","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"10","key":"968_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/2.876288","volume":"33","author":"L Prechelt","year":"2000","unstructured":"Prechelt L (2000) An empirical comparison of seven programming languages. IEEE Comput 33(10):23\u201329","journal-title":"IEEE Comput"},{"key":"968_CR14","unstructured":"Prud\u2019homme C, Fages J-G (2016) CHOCO solver: a Java library for CSP and CP. \n                    https:\/\/2.zoppoz.workers.dev:443\/http\/choco-solver.org\/"},{"issue":"9","key":"968_CR15","doi-asserted-by":"publisher","first-page":"1997","DOI":"10.1109\/TKDE.2012.175","volume":"25","author":"CR Rivero","year":"2013","unstructured":"Rivero CR, Hern\u00e1ndez I, Ruiz D, Corchuelo R (2013) Benchmarking data exchange among semantic-web ontologies. IEEE Trans Knowl Data Eng 25(9):1997\u20132009","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"968_CR16","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/s10115-012-0587-5","volume":"37","author":"CR Rivero","year":"2013","unstructured":"Rivero CR, Hern\u00e1ndez I, Ruiz D, Corchuelo R (2013) Exchanging data amongst linked data applications. Knowl Inf Syst 37(3):693\u2013729","journal-title":"Knowl Inf Syst"},{"key":"968_CR17","unstructured":"Rivero CR, Jamil HM (2014) On matching graphs using disk-based processing: an XML and XQuery implementation. In: ICDE workshops, pp 20\u201327"},{"key":"968_CR18","unstructured":"Rivero CR, Jamil HM (2016) SGMatch: implementation, data and query sets, running scripts. \n                    https:\/\/2.zoppoz.workers.dev:443\/http\/dblab.nkn.uidaho.edu\/SGMatch\/"},{"issue":"1","key":"968_CR19","first-page":"364","volume":"1","author":"H Shang","year":"2008","unstructured":"Shang H, Zhang Y, Lin X, Yu JX (2008) Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. PVLDB 1(1):364\u2013375","journal-title":"PVLDB"},{"issue":"9","key":"968_CR20","first-page":"788","volume":"5","author":"Z Sun","year":"2012","unstructured":"Sun Z, Wang H, Wang H, Shao B, Li J (2012) Efficient subgraph matching on billion node graphs. PVLDB 5(9):788\u2013799","journal-title":"PVLDB"},{"issue":"3","key":"968_CR21","first-page":"193","volume":"7","author":"Y Tian","year":"2013","unstructured":"Tian Y, Balmin A, Corsten SA, Tatikonda S, McPherson J (2013) From \u201cthink like a vertex\u201d to \u201cthink like a graph\u201d. PVLDB 7(3):193\u2013204","journal-title":"PVLDB"},{"key":"968_CR22","doi-asserted-by":"crossref","unstructured":"Tian Y, Patel JM(2008) TALE: a tool for approximate large graph matching. In: ICDE, pp 963\u2013972","DOI":"10.1109\/ICDE.2008.4497505"},{"issue":"1","key":"968_CR23","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann JR (1976) An algorithm for subgraph isomorphism. J ACM 23(1):31\u201342","journal-title":"J ACM"},{"issue":"1","key":"968_CR24","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s11590-015-0876-5","volume":"10","author":"B Yelbay","year":"2016","unstructured":"Yelbay B, Birbil SI, B\u00fclb\u00fcl K, Jamil HM (2016) Approximating the minimum hub cover problem on planar graphs. Optim Lett 10(1):33\u201345","journal-title":"Optim Lett"},{"key":"968_CR25","doi-asserted-by":"crossref","unstructured":"Zhang S, Li S, Yang J (2009) GADDI: distance index based subgraph matching in biological networks. In: EDBT, pp 192\u2013203","DOI":"10.1145\/1516360.1516384"},{"issue":"1","key":"968_CR26","first-page":"1185","volume":"3","author":"S Zhang","year":"2010","unstructured":"Zhang S, Yang J, Jin W (2010) SAPPER: subgraph indexing and approximate matching in large graphs. PVLDB 3(1):1185\u20131194","journal-title":"PVLDB"},{"issue":"1","key":"968_CR27","first-page":"340","volume":"3","author":"P Zhao","year":"2010","unstructured":"Zhao P, Han J (2010) On graph query optimization in large networks. PVLDB 3(1):340\u2013351","journal-title":"PVLDB"},{"key":"968_CR28","doi-asserted-by":"publisher","unstructured":"Zobel J, Moffat A (2006) Inverted files for text search engines. ACM Comput Surv 38(2), Article No 6. doi:\n                    10.1145\/1132956.1132959","DOI":"10.1145\/1132956.1132959"},{"issue":"9","key":"968_CR29","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1109\/TKDE.2010.80","volume":"22","author":"Z Zou","year":"2010","unstructured":"Zou Z, Li J, Gao H, Zhang S (2010) Mining frequent subgraph patterns from uncertain graph data. IEEE Trans Knowl Data Eng 22(9):1203\u20131218","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s10115-016-0968-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/article\/10.1007\/s10115-016-0968-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s10115-016-0968-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s10115-016-0968-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T08:00:46Z","timestamp":1589443246000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/10.1007\/s10115-016-0968-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,5]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["968"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/s10115-016-0968-2","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,5]]},"assertion":[{"value":"27 October 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2016","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2016","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2016","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}