{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T01:01:08Z","timestamp":1768438868924,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,11,18]],"date-time":"2016-11-18T00:00:00Z","timestamp":1479427200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s00778-016-0447-0","type":"journal-article","created":{"date-parts":[[2016,11,18]],"date-time":"2016-11-18T09:46:04Z","timestamp":1479462364000},"page":"203-228","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["PANDA: toward partial topology-based search on large networks in a single machine"],"prefix":"10.1007","volume":"26","author":[{"given":"Miao","family":"Xie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sourav S.","family":"Bhowmick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gao","family":"Cong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qing","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,18]]},"reference":[{"issue":"2","key":"447_CR1","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1093\/nar\/gkp474","volume":"37","author":"S Bruckner","year":"2009","unstructured":"Bruckner, S., Huffner, F., Karp, R.M., Shamir, R., Sharan, R.: Torque: topology-free querying of protein interaction networks. Nucl. Acids Res. 37(2), 106\u2013108 (2009)","journal-title":"Nucl. Acids Res."},{"issue":"3","key":"447_CR2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1089\/cmb.2009.0170","volume":"17","author":"S Bruckner","year":"2010","unstructured":"Bruckner, S., Huffner, F., Karp, R.M., Shamir, R., Sharan, R.: Topology-free querying of protein interaction networks. J. Comput. Biol. 17(3), 237\u2013252 (2010)","journal-title":"J. Comput. Biol."},{"issue":"4","key":"447_CR3","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/j.jebo.2003.11.005","volume":"55","author":"N Buchan","year":"2004","unstructured":"Buchan, N., Croson, R.: The boundaries of trust: own and others actions in the US and china. J. Econ. Behav. Organ. 55(4), 485\u2013504 (2004)","journal-title":"J. Econ. Behav. Organ."},{"key":"447_CR4","doi-asserted-by":"crossref","unstructured":"Cordella, L., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. Pattern Anal. Mach. Intell. IEEE Trans. 26(10), 1367\u20131372 (2004)","DOI":"10.1109\/TPAMI.2004.75"},{"key":"447_CR5","doi-asserted-by":"crossref","unstructured":"Ding, B., Xu Yu, J., Wang, S., Qin, L., Zhang, X., Lin, X.: Finding top-k min-cost connected trees in databases. In: ICDE, pp. 836\u2013845 (2007)","DOI":"10.1109\/ICDE.2007.367929"},{"issue":"1","key":"447_CR6","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0377-2217(02)00707-5","volume":"154","author":"C Duin","year":"2004","unstructured":"Duin, C., Volgenant, A., Vo\u00df, S.: Solving group steiner problems as steiner problems. Eur. J. Oper. Res. 154(1), 323\u2013329 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20132","key":"447_CR7","first-page":"264","volume":"3","author":"W Fan","year":"2010","unstructured":"Fan, W., Li, J., Ma, S., Tang, N., Wu, Y., Wu, Y.: Graph pattern matching: from intractable to polynomial time. VLDB 3(1\u20132), 264\u2013275 (2010)","journal-title":"VLDB"},{"key":"447_CR8","doi-asserted-by":"crossref","unstructured":"Fan, W., Li, J., Ma, S., Tang, N., Wu, Y.: Adding regular expressions to graph reachability and pattern queries. In: ICDE (2011)","DOI":"10.1109\/ICDE.2011.5767858"},{"key":"447_CR9","doi-asserted-by":"crossref","unstructured":"Fan, W., Li, J., Ma, S., Wang, H., Wu, Y.: Graph homomorphism revisited for graph matching. In: PVLDB (2010)","DOI":"10.14778\/1920841.1920986"},{"issue":"6\u20137","key":"447_CR10","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1016\/S0167-8655(01)00017-4","volume":"22","author":"M-L Fern\u00e1ndez","year":"2001","unstructured":"Fern\u00e1ndez, M.-L., Valiente, G.: A graph distance metric combining maximum common subgraph and minimum common supergraph. Pattern Recognit. Lett. 22(6\u20137), 753\u2013758 (2001)","journal-title":"Pattern Recognit. Lett."},{"key":"447_CR11","doi-asserted-by":"crossref","unstructured":"Han, W.-S., Lee, J., Lee, J.-H.: TurboISO: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: SIGMOD (2013)","DOI":"10.1145\/2463676.2465300"},{"key":"447_CR12","doi-asserted-by":"crossref","unstructured":"He, H., Wang, H., Yang, J., Yu, P.S.: Blinks: ranked keyword searches on graphs. In: SIGMOD, pp. 305\u2013316 (2007)","DOI":"10.1145\/1247480.1247516"},{"issue":"1","key":"447_CR13","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1002\/1097-0037(200101)37:1<8::AID-NET2>3.0.CO;2-R","volume":"37","author":"CS Helvig","year":"2001","unstructured":"Helvig, C.S., Robins, G., Zelikovsky, A.: An improved approximation scheme for the group steiner problem. Networks 37(1), 8\u201320 (2001)","journal-title":"Networks"},{"key":"447_CR14","doi-asserted-by":"crossref","unstructured":"Henzinger, M.R., Henzinger, T., Kopke, P.: Computing simulations on finite and infinite graphs. In: FOCS (1995)","DOI":"10.1109\/SFCS.1995.492576"},{"key":"447_CR15","doi-asserted-by":"crossref","unstructured":"Ihler, E.: Bounds on the quality of approximate solutions to the group steiner problem. In: Graph-Theoretic Concepts in Computer Science, pp. 109\u2013118 (1991)","DOI":"10.1007\/3-540-53832-1_36"},{"key":"447_CR16","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility Among Combinatorial Problems. Springer, Berlin (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"3","key":"447_CR17","first-page":"181","volume":"6","author":"A Khan","year":"2013","unstructured":"Khan, A., Wu, Y., Aggarwal, C.C., Yan, X.: NeMa: fast graph search with label similarity. VLDB 6(3), 181\u2013192 (2013)","journal-title":"VLDB"},{"key":"447_CR18","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection (2014)"},{"key":"447_CR19","doi-asserted-by":"crossref","unstructured":"Ma, S., Cao, Y., Fan, W., Huai, J., Wo, T.: Strong simulation: Capturing topology in graph pattern matching, vol. 39. In: TODS (2014)","DOI":"10.1145\/2528937"},{"key":"447_CR20","doi-asserted-by":"crossref","unstructured":"Morsey, M., Lehmann, J., Auer, S., Ngomo, A.-C.N.: DBpedia SPARQL benchmark-performance assessment with real queries on real data. In: ISWC, volume 7031 of LNCS, pp. 454\u2013469. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-25073-6_29"},{"key":"447_CR21","unstructured":"Pearl, J.: Reverend Bayes on inference engines: a distributed hierarchical approach. In: AAAI (1982)"},{"key":"447_CR22","doi-asserted-by":"crossref","unstructured":"Pinter, R.Y., Shachnai, H., Zehavi, M.: Partial information network queries. J. Discrete Algorithms 31, 129\u2013145 (2015)","DOI":"10.1016\/j.jda.2014.11.007"},{"key":"447_CR23","doi-asserted-by":"crossref","unstructured":"Pinter, R.Y., Shachnai, H., Zehavi, M.: Improved parameterized algorithms for network query problems. In: Parameterized and Exact Computation, pp. 294\u2013306. Springer (2014)","DOI":"10.1007\/978-3-319-13524-3_25"},{"key":"447_CR24","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"},{"key":"447_CR25","doi-asserted-by":"crossref","unstructured":"Sun, Z., Wang, H., Wang, H., Shao, B., Li, J.: Efficient subgraph matching on billion node graphs. In: PVLDB (2012)","DOI":"10.14778\/2311906.2311907"},{"key":"447_CR26","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":"447_CR27","doi-asserted-by":"crossref","unstructured":"Xie, Y., Yu, P.S.: CP-index: on the efficient indexing of large graphs. In: CIKM (2011)","DOI":"10.1145\/2063576.2063835"},{"key":"447_CR28","doi-asserted-by":"crossref","unstructured":"Yang, S., Wu, Y., Sun, H., Yan, X.: Schemaless and structureless graph querying. VLDB 7(7), 565\u2013576 (2014)","DOI":"10.14778\/2732286.2732293"},{"key":"447_CR29","doi-asserted-by":"crossref","unstructured":"Yuan, Y., Wang, G., Xu, J. Y., Chen, L.: Efficient distributed subgraph similarity matching. VLDB J. 24(3), 369\u2013394 (2010)","DOI":"10.1007\/s00778-015-0381-6"},{"key":"447_CR30","first-page":"1185","volume":"3","author":"S Zhang","year":"2010","unstructured":"Zhang, S., Yang, J., Jin, W.: SAPPER: subgraph indexing and approximate matching in large graphs. VLDB 3, 1185\u20131194 (2010)","journal-title":"VLDB"},{"key":"447_CR31","doi-asserted-by":"crossref","unstructured":"Zeng, Z., Tung, A. K. H., Wang, J., Feng, J., Zhou, L.: Comparing stars: on approximating graph edit distance. In: VLDB (2009)","DOI":"10.14778\/1687627.1687631"},{"key":"447_CR32","doi-asserted-by":"crossref","unstructured":"Zhang, S., Li, S., Yang, J.: GADDI: distance index based subgraph matching in biological networks. In: EDBT (2009)","DOI":"10.1145\/1516360.1516384"},{"key":"447_CR33","doi-asserted-by":"crossref","unstructured":"Zhu, G., Lin, X., Zhu, K., Zhang, W., Yu, J.X.: TreeSpan: efficiently computing similarity all-matching. In: SIGMOD, pp. 529\u2013540 (2012)","DOI":"10.1145\/2213836.2213896"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-016-0447-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-016-0447-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-016-0447-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T18:59:38Z","timestamp":1568573978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-016-0447-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,18]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["447"],"URL":"https:\/\/doi.org\/10.1007\/s00778-016-0447-0","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,18]]}}}