{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T11:21:21Z","timestamp":1760008881087},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2015,3,27]],"date-time":"2015-03-27T00:00:00Z","timestamp":1427414400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Circuits Syst Signal Process"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s00034-015-0030-8","type":"journal-article","created":{"date-parts":[[2015,3,27]],"date-time":"2015-03-27T01:58:16Z","timestamp":1427421496000},"page":"3671-3680","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["The SVE Method for Regular Graph Isomorphism Identification"],"prefix":"10.1007","volume":"34","author":[{"given":"Huiliang","family":"Shang","sequence":"first","affiliation":[]},{"given":"Feng","family":"Kang","sequence":"additional","affiliation":[]},{"given":"Chen","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Guobin","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Siyuan","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,27]]},"reference":[{"issue":"3","key":"30_CR1","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF01259368","volume":"1","author":"MA Abdulrahim","year":"1998","unstructured":"M.A. Abdulrahim, M. Misra, A graph isomorphism algorithm for object recognition. Pattern Anal. Appl. 1(3), 189\u2013201 (1998)","journal-title":"Pattern Anal. Appl."},{"issue":"Suppl 7","key":"30_CR2","doi-asserted-by":"crossref","first-page":"S13","DOI":"10.1186\/1471-2105-14-S7-S13","volume":"14","author":"V Bonnici","year":"2013","unstructured":"V. Bonnici, R. Giugno, A. Pulvirenti et al., A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinform. 14(Suppl 7), S13 (2013)","journal-title":"BMC Bioinform."},{"issue":"1","key":"30_CR3","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.tcs.2006.07.010","volume":"362","author":"A Bretto","year":"2006","unstructured":"A. Bretto, A. Faisant, T. Vall\u00e9e, Compatible topologies on graphs: an application to graph isomorphism problem complexity. Theor. Comput. Sci. 362(1), 255\u2013272 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"30_CR4","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1109\/TPAMI.2009.28","volume":"31","author":"TS Caetano","year":"2009","unstructured":"T.S. Caetano, J.J. McAuley, L. Cheng, Q.V. Le, A.J. Smola, Learning graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 31(6), 1048\u20131058 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"30_CR5","doi-asserted-by":"crossref","DOI":"10.1142\/2446","volume-title":"Graph Theory and Its Engineering Applications (Vol. 29)","author":"WK Chen","year":"1997","unstructured":"W.K. Chen, Graph Theory and Its Engineering Applications (Vol. 29) (World Scientific, River Edge, New Jersey, 1997)"},{"key":"30_CR6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-3-540-68020-8_4","volume-title":"Applied Graph Theory in Computer Vision and Pattern Recognition","author":"D Conte","year":"2007","unstructured":"D. Conte, P. Foggia, C. Sansone, M. Vento, How and why pattern recognition and computer vision applications use graphs, in Applied Graph Theory in Computer Vision and Pattern Recognition, ed. by A. Kandel, H. Bunke, M. Last (Springer, Berlin, 2007), pp. 85\u2013135"},{"key":"30_CR7","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.tcs.2013.05.026","volume":"498","author":"C Higuera De La","year":"2013","unstructured":"C. De La Higuera, J.C. Janodet, \u00c9. Samuel, G. Damiand, C. Solnon, Polynomial algorithms for open plane graph and subgraph isomorphisms. Theor. Comput. Sci. 498, 76\u201399 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"30_CR8","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.1109\/TPAMI.2005.138","volume":"27","author":"M Gori","year":"2005","unstructured":"M. Gori, M. Maggini, L. Sarti, Exact and approximate graph matching using random walks. IEEE Trans. Pattern Anal. Mach. Intell. 27(7), 1100\u20131111 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"30_CR9","volume-title":"The Graph Isomorphism Problem: Its Structural Complexity","author":"J K\u00f6bler","year":"1994","unstructured":"J. K\u00f6bler, U. Sch\u00f6ning, J. Tor\u00e1n, The Graph Isomorphism Problem: Its Structural Complexity (Birkhauser Verlag, Basel, 1994)"},{"issue":"5","key":"30_CR10","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1007\/s00034-008-9054-7","volume":"27","author":"F Li","year":"2008","unstructured":"F. Li, H. Shang, P.Y. Woo, Determination of isomorphism and its applications for arbitrary graphs based on circuit simulation. Circuits Syst. Signal Process. 27(5), 749\u2013761 (2008)","journal-title":"Circuits Syst. Signal Process."},{"key":"30_CR11","doi-asserted-by":"crossref","first-page":"3920","DOI":"10.1063\/1.1680839","volume":"60","author":"M Randi\u0107","year":"1974","unstructured":"M. Randi\u0107, On the recognition of identical graphs representing molecular topology. J. Chem. Phys. 60, 3920\u20133928 (1974)","journal-title":"J. Chem. Phys."},{"issue":"8","key":"30_CR12","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1109\/TPAMI.2012.260","volume":"35","author":"D Raviv","year":"2013","unstructured":"D. Raviv, R. Kimmel, A.M. Bruckstein, Graph isomorphisms and automorphisms via spectral signatures. IEEE Trans. Pattern Anal. Mach. Intell. 35(8), 1985\u20131993 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"30_CR13","doi-asserted-by":"crossref","first-page":"022334","DOI":"10.1103\/PhysRevA.86.022334","volume":"86","author":"K Rudinger","year":"2012","unstructured":"K. Rudinger, J.K. Gamble, M. Wellons, E. Bach, M. Friesen, R. Joynt, S.N. Coppersmith, Noninteracting multiparticle quantum random walks applied to the graph isomorphism problem for strongly regular graphs. Phys. Rev. A 86(2), 022334 (2012)","journal-title":"Phys. Rev. A"},{"issue":"5","key":"30_CR14","doi-asserted-by":"crossref","first-page":"2469","DOI":"10.1007\/s00034-013-9587-2","volume":"32","author":"H Shang","year":"2013","unstructured":"H. Shang, Y. Gao, J. Zhu, An optimized circuit simulation method for the identification of isomorphic disconnected graphs. Circuits Syst. Signal Process. 32(5), 2469\u20132473 (2013)","journal-title":"Circuits Syst. Signal Process."}],"container-title":["Circuits, Systems, and Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00034-015-0030-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-015-0030-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-015-0030-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,26]],"date-time":"2019-02-26T14:11:43Z","timestamp":1551190303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00034-015-0030-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,27]]},"references-count":14,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["30"],"URL":"https:\/\/doi.org\/10.1007\/s00034-015-0030-8","relation":{},"ISSN":["0278-081X","1531-5878"],"issn-type":[{"value":"0278-081X","type":"print"},{"value":"1531-5878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,27]]}}}