{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:03:46Z","timestamp":1758845026809,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2018,11,2]],"date-time":"2018-11-02T00:00:00Z","timestamp":1541116800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602374","61602376"],"award-info":[{"award-number":["61602374","61602376"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61702411"],"award-info":[{"award-number":["61702411"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007128","name":"Natural Science Foundation of Shaanxi Province","doi-asserted-by":"publisher","award":["2016JQ6041","2017JQ6020"],"award-info":[{"award-number":["2016JQ6041","2017JQ6020"]}],"id":[{"id":"10.13039\/501100007128","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010228","name":"Natural Science Foundation of Shaanxi Provincial Department of Education","doi-asserted-by":"publisher","award":["16JK1552"],"award-info":[{"award-number":["16JK1552"]}],"id":[{"id":"10.13039\/501100010228","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Foundation of Xi\u2019an University of Technology","award":["112-451115002"],"award-info":[{"award-number":["112-451115002"]}]},{"DOI":"10.13039\/501100010228","name":"Natural Science Foundation of Shaanxi Provincial Department of Education","doi-asserted-by":"publisher","award":["16JK1573"],"award-info":[{"award-number":["16JK1573"]}],"id":[{"id":"10.13039\/501100010228","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s00521-018-3837-y","type":"journal-article","created":{"date-parts":[[2018,11,2]],"date-time":"2018-11-02T10:44:13Z","timestamp":1541155453000},"page":"5671-5678","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A novel subgraph querying method based on paths and spectra"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5925-5743","authenticated-orcid":false,"given":"Lei","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanni","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yichuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinhong","family":"Hei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qin","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjiang","family":"Ji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quanzhu","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,2]]},"reference":[{"key":"3837_CR1","first-page":"665","volume":"78","author":"A Ilic","year":"2017","unstructured":"Ilic A, Ilic M (2017) On some algorithms for computing topological indices of chemical graphs. MATCH Commun Math Comput Chem 78:665\u2013674","journal-title":"MATCH Commun Math Comput Chem"},{"issue":"3","key":"3837_CR2","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1093\/bioinformatics\/btx602","volume":"34","author":"M Sugiyama","year":"2017","unstructured":"Sugiyama M, Ghisu ME et al (2017) graphkernels: R and Python packages for graph comparison. Bioinformatics 34(3):530\u2013532","journal-title":"Bioinformatics"},{"issue":"2","key":"3837_CR3","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1109\/TIP.2015.2502147","volume":"25","author":"L Zhang","year":"2016","unstructured":"Zhang L, Yang Y et al (2016) Detecting densely distributed graph patterns for fine-grained image categorization. IEEE Trans Image Process 25(2):553\u2013565","journal-title":"IEEE Trans Image Process"},{"issue":"1","key":"3837_CR4","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1109\/TKDE.2013.170","volume":"27","author":"B Xu","year":"2015","unstructured":"Xu B, Bu J et al (2015) EMR: a scalable graph-based ranking model for content-based image retrieval. IEEE Trans Knowl Data Eng 27(1):102\u2013114","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"3837_CR5","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s00778-015-0415-0","volume":"25","author":"P Peng","year":"2016","unstructured":"Peng P, Zou L et al (2016) Processing SPARQL queries over distributed RDF graphs. VLDB J 25(2):243\u2013268","journal-title":"VLDB J"},{"key":"3837_CR6","unstructured":"Peng P, Zou L, Chen L et al (2016) Query workload-based RDF graph fragmentation and allocation. In: EDBT"},{"issue":"8","key":"3837_CR7","doi-asserted-by":"publisher","first-page":"2583","DOI":"10.1007\/s00500-017-2513-y","volume":"22","author":"H Rong","year":"2018","unstructured":"Rong H, Ma T, Tang M et al (2018) A novel subgraph \n                    \n                      \n                    \n                    $$K^{+}$$\n                    \n                      \n                        \n                          K\n                          +\n                        \n                      \n                    \n                  -isomorphism method in social network based on graph similarity detection. Soft Comput 22(8):2583\u20132601","journal-title":"Soft Comput"},{"issue":"7","key":"3837_CR8","doi-asserted-by":"publisher","first-page":"1805","DOI":"10.1109\/TKDE.2016.2530063","volume":"28","author":"W Zheng","year":"2016","unstructured":"Zheng W, Lian X, Zou L et al (2016) Online subgraph skyline analysis over knowledge graphs. IEEE Trans Knowl Data Eng 28(7):1805\u20131819","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3837_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.procs.2015.02.005","volume":"46","author":"AK Murthy","year":"2015","unstructured":"Murthy AK (2015) XML URL classification based on their semantic structure orientation for web mining applications. Proc Comput Sci 46:143\u2013150","journal-title":"Proc Comput Sci"},{"key":"3837_CR10","doi-asserted-by":"publisher","first-page":"4176","DOI":"10.1109\/ACCESS.2018.2790427","volume":"6","author":"N Li","year":"2018","unstructured":"Li N, Bai L (2018) Transforming fuzzy spatiotemporal data from relational databases to XML. IEEE Access 6:4176\u20134185","journal-title":"IEEE Access"},{"key":"3837_CR11","volume-title":"Computers and intractabiltiy","author":"M Garey","year":"2002","unstructured":"Garey M, Johnson D (2002) Computers and intractabiltiy. Freeman, New York"},{"key":"3837_CR12","first-page":"112","volume":"2","author":"R Giugno","year":"2002","unstructured":"Giugno R, Shasha D (2002) Graphgrep: a fast and universal method for querying graphs. Proc IEEE Int Conf Pattern Recognit 2:112\u2013115","journal-title":"Proc IEEE Int Conf Pattern Recognit"},{"key":"3837_CR13","doi-asserted-by":"crossref","unstructured":"Yan X, Yu P, Han J (2004) Graph indexing: a frequent structure-based approach. In: Proceedings of the ACM SIGMOD international conference on management of data, pp 335\u2013346","DOI":"10.1145\/1007568.1007607"},{"key":"3837_CR14","unstructured":"He H, Singh AK (2006) Closure-tree: an index structure for graph queries. In: Proceedings of the IEEE international conference on data engineering, pp 38\u201349"},{"key":"3837_CR15","doi-asserted-by":"crossref","unstructured":"Cheng J, Ke Y et al (2007) Fg-index: towards verification-free query processing on graph databases. In: Proceedings of the ACM SIGMOD international conference on management of data, pp 857\u2013872","DOI":"10.1145\/1247480.1247574"},{"key":"3837_CR16","doi-asserted-by":"crossref","unstructured":"Zhang S, Hu M, Yang J (2007) Treepi: a novel graph indexing method. In: Proceedings of the IEEE international conference on data engineering, pp 966\u2013975","DOI":"10.1109\/ICDE.2007.368955"},{"key":"3837_CR17","unstructured":"Zhao P, Yu J, Yu P (2007) Graph indexing: Tree+ delta \n                    \n                      \n                    \n                    $$>=$$\n                    \n                      \n                        \n                          >\n                          =\n                        \n                      \n                    \n                   graph. In: Proceedings of the international conference on very large data bases, pp 938\u2013949"},{"issue":"1","key":"3837_CR18","first-page":"364","volume":"1","author":"H Shang","year":"2008","unstructured":"Shang H, Zhang Y, Lin X, Yu J (2008) Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. Proc Int Conf Very Large Data Bases 1(1):364\u2013375","journal-title":"Proc Int Conf Very Large Data Bases"},{"key":"3837_CR19","doi-asserted-by":"crossref","unstructured":"Zou L, Chen L, Yu J, Lu Y (2008) A novel spectral coding in a large graph database. In: Proceedings of the international conference on extending database technology, pp 181\u2013192","DOI":"10.1145\/1353343.1353369"},{"key":"3837_CR20","unstructured":"Zhu L, Song Q (2011) A study of Laplaican spectra of graph for subgraph queries. In: Proceedings of the IEEE international conference on data mining, pp 1272\u20131277"},{"key":"3837_CR21","volume-title":"Handbook of graph theory, combinatorial optimization, and algorithms","author":"S Arumugam","year":"2016","unstructured":"Arumugam S et al (2016) Handbook of graph theory, combinatorial optimization, and algorithms. Chapman and Hall, London"},{"key":"3837_CR22","volume-title":"Basic matrix theory","author":"LE Fuller","year":"2017","unstructured":"Fuller LE (2017) Basic matrix theory. Courier Dover Publications, Mineola"},{"issue":"2","key":"3837_CR23","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0306-4379(01)00047-3","volume":"27","author":"E Tousidou","year":"2002","unstructured":"Tousidou E, Bozanis P, Manolopoulos Y (2002) Signature-based structures for objects with set-valued attributes. Inf Syst 27(2):93\u2013121","journal-title":"Inf Syst"},{"issue":"10","key":"3837_CR24","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"L Cordella","year":"2004","unstructured":"Cordella L, Foggia P, Sansone C et al (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":"3837_CR25","doi-asserted-by":"crossref","unstructured":"Han W, Pham M, Lee J et al (2011) iGraph in action: performance analysis of disk-based graph indexing techniques. In: Proceedings of the ACM SIGMOD international conference on management of data, pp 1241\u20131242","DOI":"10.1145\/1989323.1989464"},{"issue":"1","key":"3837_CR26","first-page":"340","volume":"3","author":"W Han","year":"2010","unstructured":"Han W, Lee J, Pham M et al (2010) iGraph: a framework for comparisons of disk-based graph indexing techniques. Proc VLDB Endow 3(1):340\u2013351","journal-title":"Proc VLDB Endow"},{"issue":"6","key":"3837_CR27","first-page":"653","volume":"80","author":"H Kitagawa","year":"1997","unstructured":"Kitagawa H, Ishikawa Y (1997) False drop analysis of set retrieval with signature files. IEICE Trans Inf Syst 80(6):653\u2013664","journal-title":"IEICE Trans Inf Syst"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-018-3837-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-018-3837-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-018-3837-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T20:28:56Z","timestamp":1572640136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-018-3837-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,2]]},"references-count":27,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["3837"],"URL":"https:\/\/doi.org\/10.1007\/s00521-018-3837-y","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2018,11,2]]},"assertion":[{"value":"6 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}