{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T08:29:04Z","timestamp":1648888144606},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2013,4,11]],"date-time":"2013-04-11T00:00:00Z","timestamp":1365638400000},"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":[[2013,10]]},"DOI":"10.1007\/s00034-013-9587-2","type":"journal-article","created":{"date-parts":[[2013,4,10]],"date-time":"2013-04-10T10:49:18Z","timestamp":1365590958000},"page":"2469-2473","source":"Crossref","is-referenced-by-count":2,"title":["An Optimized Circuit Simulation Method for the Identification of Isomorphic Disconnected Graphs"],"prefix":"10.1007","volume":"32","author":[{"given":"Huiliang","family":"Shang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiajun","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,4,11]]},"reference":[{"key":"9587_CR1","first-page":"391","volume-title":"Proceedings of the Conference on European Design Automation","author":"M.S. Abadir","year":"1990","unstructured":"M.S. Abadir, J. Ferguson, An improved layout verification algorithm (LAVA), in Proceedings of the Conference on European Design Automation (IEEE Comput. Soc., Los Alamitos, 1990), pp.\u00a0391\u2013395"},{"issue":"3","key":"9587_CR2","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF01259368","volume":"1","author":"M.A. Abdulrahim","year":"1998","unstructured":"M.A. Abdulrahim, M. Misra, A graph isomorphism algorithm for object recognition. PAA Pattern Anal. Appl. 1(3), 189\u2013201 (1998)","journal-title":"PAA Pattern Anal. Appl."},{"issue":"6","key":"9587_CR3","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1109\/TPAMI.2009.28","volume":"31","author":"T.S. 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."},{"issue":"10","key":"9587_CR4","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"L.P. Cordella","year":"2004","unstructured":"L.P. Cordella, P. Foggia, C. Sansone, M. Vento, A (sub) graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26(10), 1367\u20131372 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9587_CR5","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1109\/ICCAD.1988.122520","volume-title":"IEEE International Conference on Computer-Aided Design (ICCAD-88). Digest of Technical Papers","author":"C. Ebeling","year":"1988","unstructured":"C. Ebeling, GeminiII: a second generation layout validation program, in IEEE International Conference on Computer-Aided Design (ICCAD-88). Digest of Technical Papers, 7\u201310 Nov. 1988, pp.\u00a0322\u2013325"},{"issue":"3","key":"9587_CR6","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1021\/ci9702914","volume":"38","author":"J.L. Faulon","year":"1998","unstructured":"J.L. Faulon, Isomorphism, automorphism partitioning, and canonical labeling can be solved in polynomial-time for molecular graphs. J. Chem. Inf. Comput. Sci. 38(3), 432\u2013444 (1998)","journal-title":"J. Chem. Inf. Comput. Sci."},{"issue":"5","key":"9587_CR7","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."},{"issue":"4","key":"9587_CR8","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0094-114X(02)00120-9","volume":"38","author":"T. Mruthyunjaya","year":"2003","unstructured":"T. Mruthyunjaya, Kinematic structure of mechanisms revisited. Mech. Mach. Theory 38(4), 279\u2013320 (2003)","journal-title":"Mech. Mach. Theory"},{"issue":"5","key":"9587_CR9","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1007\/s00034-010-9248-7","volume":"30","author":"H. Shang","year":"2011","unstructured":"H. Shang, F. Li, X. Tang, P.Y. Woo, A new algorithm for isomorphism determination of undirected graphs-circuit simulation method. Circuits Syst. Signal Process. 30(5), 1115\u20131130 (2011)","journal-title":"Circuits Syst. Signal Process."},{"key":"9587_CR10","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1109\/ICMIC.2011.5973730","volume-title":"Proceedings of 2011 International Conference on Modelling, Identification and Control (ICMIC)","author":"H. Shang","year":"2011","unstructured":"H. Shang, J. Li, Q. Cai, W. Dong, An optimized algorithm for the identification of isomorphic undirected graphs, in Proceedings of 2011 International Conference on Modelling, Identification and Control (ICMIC) (IEEE Press, New York, 2011), pp.\u00a0351\u2013356"},{"key":"9587_CR11","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719574","volume-title":"Numerical Linear Algebra","author":"L.N. Trefethen","year":"1997","unstructured":"L.N. Trefethen, D. Bau III, Numerical Linear Algebra, vol.\u00a050 (SIAM, Philadelphia, 1997)"}],"container-title":["Circuits, Systems, and Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-013-9587-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00034-013-9587-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-013-9587-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T11:01:40Z","timestamp":1558522900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00034-013-9587-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,11]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9587"],"URL":"https:\/\/doi.org\/10.1007\/s00034-013-9587-2","relation":{},"ISSN":["0278-081X","1531-5878"],"issn-type":[{"value":"0278-081X","type":"print"},{"value":"1531-5878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,11]]}}}