{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,9]],"date-time":"2024-07-09T00:54:44Z","timestamp":1720486484297},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,12,23]],"date-time":"2010-12-23T00:00:00Z","timestamp":1293062400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Circuits Syst Signal Process"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s00034-010-9248-7","type":"journal-article","created":{"date-parts":[[2010,12,22]],"date-time":"2010-12-22T23:01:18Z","timestamp":1293058878000},"page":"1115-1130","source":"Crossref","is-referenced-by-count":5,"title":["A New Algorithm for Isomorphism Determination of\u00a0Undirected Graphs-Circuit Simulation Method"],"prefix":"10.1007","volume":"30","author":[{"given":"Huiliang","family":"Shang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"XianDing","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng-Yung","family":"Woo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,12,23]]},"reference":[{"key":"9248_CR1","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1109\/RNNS.1992.268621","volume-title":"RNNS\/IEEE Symposium on Neuroinformatics and Neurocomputers","author":"K. Agusa","year":"1992","unstructured":"K. Agusa, S. Fujita, M. Yamashita, T. Ae, On neural networks for graph isomorphism problem, in RNNS\/IEEE Symposium on Neuroinformatics and Neurocomputers (Oct 1992), pp. 1142\u20131148"},{"key":"9248_CR2","series-title":"McGraw\u2013Hill Science Engineering","volume-title":"Fundamentals of Electric Circuits","author":"C.K. Alexander","year":"2004","unstructured":"C.K. Alexander, Fundamentals of Electric Circuits. McGraw\u2013Hill Science Engineering (2004)"},{"issue":"1","key":"9248_CR3","first-page":"35","volume":"23","author":"J. Cai","year":"2006","unstructured":"J. Cai et al., The genetic algorithm for graph isomorphism. Proc. SuZhou Sci. Technol. Coll., 23(1), 35\u201338 (2006) (in Chinese)","journal-title":"Proc. SuZhou Sci. Technol. Coll."},{"issue":"6","key":"9248_CR4","first-page":"39","volume":"28","author":"L. Chen","year":"2002","unstructured":"L. Chen et al., The parallel algorithm for isomorphism determination of undirected graphs. Comput. Eng. 28(6), 39\u201340 (2002) (in Chinese)","journal-title":"Comput. Eng."},{"issue":"3","key":"9248_CR5","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D. Conte","year":"2004","unstructured":"D. Conte, P. Foggia, C. Sansone, M. Vento, Thirty years of graph matching in pattern recognition. Int. J. Pattern Recognit. Artif. Intell. 18(3), 265\u2013298 (2004)","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"key":"9248_CR6","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s100320000036","volume":"3","author":"L.P. Cordella","year":"2000","unstructured":"L.P. Cordella, M. Vento, Symbol recognition in documents: a collection of techniques. Int. J. Doc. Anal. Recognit. 3, 73\u201388 (2000)","journal-title":"Int. J. Doc. Anal. Recognit."},{"key":"9248_CR7","first-page":"176","volume-title":"Int\u2019l Workshop on Graph-Based Representations in Pattern Recognition","author":"P. Foggia","year":"2001","unstructured":"P. Foggia, C. Sansone, M. Vento, A database of graphs for isomorphism and sub graph isomorphism benchmarking, in Int\u2019l Workshop on Graph-Based Representations in Pattern Recognition, Italy (2001), pp.\u00a0176\u2013188"},{"key":"9248_CR8","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/COGANN.1992.273944","volume-title":"1992 International Workshop on Combinations of Genetic Algorithms and Neural Networks","author":"P.J.B. Hancock","year":"1992","unstructured":"P.J.B. Hancock, Genetic algorithms and permutation problems: a comparison of recombination operators for neural network structure specification, in 1992 International Workshop on Combinations of Genetic Algorithms and Neural Networks, Baltimore (1992), pp.\u00a0108\u2013122"},{"key":"9248_CR9","volume-title":"Graph Theory","author":"F. Harary","year":"1981","unstructured":"F. Harary, Graph Theory (1981)"},{"issue":"10","key":"9248_CR10","doi-asserted-by":"crossref","first-page":"1106","DOI":"10.1109\/34.954601","volume":"23","author":"L. Jianzhuang","year":"2001","unstructured":"L. Jianzhuang, L.Y. Tsui, Graph-based method for face identification from a single 2D line drawing. IEEE Trans. Pattern Anal. Mach. Intell. 23(10), 1106\u20131119 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"9248_CR11","first-page":"318","volume":"40","author":"F. Li","year":"2001","unstructured":"F. Li, S.-Y. Li, An algorithm for graph isomorphism determination\u2014degree distribution sequence method and its application. J. Fudan Univ. (Nat. Sci.) 40(3), 318\u2013325 (2001) (in Chinese)","journal-title":"J. Fudan Univ. (Nat. Sci.)"},{"issue":"5","key":"9248_CR12","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.-L. 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":"9248_CR13","volume-title":"Numerical Linear Algebra","author":"N. Lloyd","year":"1997","unstructured":"N. Lloyd et al., Numerical Linear Algebra (SIAM, Philadelphia, 1997)"},{"key":"9248_CR14","unstructured":"B.T. Messmer, Efficient graph matching algorithms for preprocessed model graphs. PhD Thesis, Inst. of Computer Science and Applied Mathematics, Univ. of Bern (1996)"},{"issue":"8","key":"9248_CR15","doi-asserted-by":"crossref","first-page":"1933","DOI":"10.1162\/089976699300016034","volume":"11","author":"M. Pelillo","year":"1999","unstructured":"M. Pelillo, Replicator equations, maximal cliques, and graph isomorphism. Neural Comput. 11(8), 1933\u20131955 (1999)","journal-title":"Neural Comput."},{"key":"9248_CR16","first-page":"56","volume-title":"2009 Annual Meeting of Chinese Professional Committee of Graph Theory and System Optimization","author":"H.-L. Shang","year":"2009","unstructured":"H.-L. Shang, F. Li, An algorithm for isomorphism determination of undirected graphs: circuit simulation method, in 2009 Annual Meeting of Chinese Professional Committee of Graph Theory and System Optimization, Harbin, China (2009), pp. 56\u201363 (in Chinese)"},{"key":"9248_CR17","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/ECNN.2000.886223","volume-title":"IEEE Symposium on Combinations of Evolutionary Computation and Neural Networks (ECNN 2000)","author":"P. Stagge","year":"2000","unstructured":"P. Stagge, C. Igel, Neural network structures and isomorphism: random walk characteristics of the search space, in IEEE Symposium on Combinations of Evolutionary Computation and Neural Networks (ECNN 2000) (2000), pp. 82\u201390"},{"issue":"2","key":"9248_CR18","first-page":"163","volume":"19","author":"W. Zang","year":"2007","unstructured":"W. Zang, F. Li, The algorithm for isomorphism determination of arbitrary connected graphs: the eigenvector method. Comput. Aided Des. Graphs 19(2), 163\u2013167 (2007) (in Chinese)","journal-title":"Comput. Aided Des. Graphs"}],"container-title":["Circuits, Systems, and Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-010-9248-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00034-010-9248-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-010-9248-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T15:01:33Z","timestamp":1558537293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00034-010-9248-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,23]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["9248"],"URL":"https:\/\/doi.org\/10.1007\/s00034-010-9248-7","relation":{},"ISSN":["0278-081X","1531-5878"],"issn-type":[{"value":"0278-081X","type":"print"},{"value":"1531-5878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,23]]}}}