{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T11:23:27Z","timestamp":1760009007037,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T00:00:00Z","timestamp":1570233600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T00:00:00Z","timestamp":1570233600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Circuits Syst Signal Process"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s00034-019-01279-8","type":"journal-article","created":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T05:02:46Z","timestamp":1570251766000},"page":"2695-2715","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Time-Based Solution for the Graph Isomorphism Problem"],"prefix":"10.1007","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1748-5107","authenticated-orcid":false,"given":"Morteza","family":"Moradi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,5]]},"reference":[{"issue":"1","key":"1279_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/(SICI)1097-0118(199709)26:1<35::AID-JGT5>3.0.CO;2-I","volume":"26","author":"REL Aldred","year":"1997","unstructured":"R.E.L. Aldred, M.N. Ellingham, R.L. Hemminger, P. Jipsen, P3-isomorphisms for graphs. J. Graph Theory 26(1), 35\u201351 (1997)","journal-title":"J. Graph Theory"},{"key":"1279_CR2","unstructured":"A. Atserias, E. Maneva, Graph isomorphism, Sherali-Adams relaxations and expressibility in counting logics, in Electronic Colloquium on Computational Complexity, vol. 77 (2011), pp. 1\u201334"},{"issue":"1\u20133","key":"1279_CR3","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/S0166-218X(99)00140-7","volume":"99","author":"L Babel","year":"2000","unstructured":"L. Babel, Recognition and isomorphism of tree-like P4-connected graphs. Discrete Appl. Math. 99(1\u20133), 295\u2013315 (2000)","journal-title":"Discrete Appl. Math."},{"key":"1279_CR4","unstructured":"A. Dharwadker, J. T. Tevet, The graph isomorphism algorithm, in Proceedings of the structure semiotics research group s.e.r.r. eurouniversity, TALLINN (2009), pp. 1\u201330"},{"key":"1279_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.disc.2014.01.001","volume":"323","author":"E Dobson","year":"2014","unstructured":"E. Dobson, I. Kovacs, S. Miklavic, The isomorphism problem for window graphs. Discrete Math. 323, 7\u201313 (2014)","journal-title":"Discrete Math."},{"issue":"2","key":"1279_CR6","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1023\/A:1006133917784","volume":"15","author":"JA Fill","year":"1999","unstructured":"J.A. Fill, D.E. Fishkind, E.R. Scheinerman, Affine isomorphism for partially ordered sets. Order 15(2), 183\u2013193 (1999)","journal-title":"Order"},{"key":"1279_CR7","unstructured":"K. Fukuda, M. Nakamori, Graph isomorphism algorithm by perfect matching, in IFIP Conference on System Modelling and Optimization, vol. 130 (2003), pp. 229\u2013238"},{"key":"1279_CR8","unstructured":"M. Furst, J. Hopcroft, E. Luks, Polynomial-time algorithm for permutation groups, in 21st Annual Symposium on Foundations of Computer Science (1980), pp. 36\u201341"},{"issue":"11","key":"1279_CR9","doi-asserted-by":"publisher","first-page":"2646","DOI":"10.1109\/TCSI.2012.2190676","volume":"59","author":"ZH Guan","year":"2012","unstructured":"Z.H. Guan, F.L. Sun, Y.W. Wang, T. Li, Finite time consensus for leader-following second-order multi-agent networks. IEEE Trans. Circuits Syst. I 59(11), 2646\u20132654 (2012)","journal-title":"IEEE Trans. Circuits Syst. I"},{"issue":"2","key":"1279_CR10","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0195-6698(03)00100-8","volume":"25","author":"WH Haemers","year":"2004","unstructured":"W.H. Haemers, E. Spence, Enumeration of co-spectral graphs. Eur. J. Combin. 25(2), 199\u2013211 (2004)","journal-title":"Eur. J. Combin."},{"issue":"1","key":"1279_CR11","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1145\/1077464.1077476","volume":"1","author":"DS Johnson","year":"2005","unstructured":"D.S. Johnson, The NP-completeness column. ACM Trans. Algorithms 1(1), 160\u2013176 (2005)","journal-title":"ACM Trans. Algorithms"},{"issue":"21","key":"1279_CR12","doi-asserted-by":"publisher","first-page":"3164","DOI":"10.1016\/j.disc.2012.07.010","volume":"312","author":"S Kijima","year":"2012","unstructured":"S. Kijima, Y. Otachi, T. Saitoh, T. Uno, Subgraph isomorphism in graph classes. Discrete Math. 312(21), 3164\u20133173 (2012)","journal-title":"Discrete Math."},{"issue":"1","key":"1279_CR13","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1109\/TCSI.2009.2023937","volume":"57","author":"Z Li","year":"2010","unstructured":"Z. Li, Z. Duan, G. Chen, L. Huang, Consensus of multiagent systems and synchronization of complex networks: a unified viewpoint. IEEE Trans. Circuits Syst. I 57(1), 213\u2013224 (2010)","journal-title":"IEEE Trans. Circuits Syst. I"},{"issue":"1","key":"1279_CR14","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"EM Luks","year":"1982","unstructured":"E.M. Luks, Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Syst. Sci. 25(1), 42\u201365 (1982)","journal-title":"J. Comput. Syst. Sci."},{"key":"1279_CR15","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0024-3795(94)90486-3","volume":"197\u2013198","author":"R Merris","year":"1994","unstructured":"R. Merris, Laplacian matrices of graphs: a survey. Linear Algebra Appl. 197\u2013198, 143\u2013176 (1994)","journal-title":"Linear Algebra Appl."},{"issue":"5","key":"1279_CR16","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/BF01225642","volume":"5","author":"IN Ponomarenko","year":"1994","unstructured":"I.N. Ponomarenko, Graph algebras and the graph isomorphism problem. Appl. Algebra Eng. Commun. 5(5), 277\u2013286 (1994)","journal-title":"Appl. Algebra Eng. Commun."},{"issue":"1\u20133","key":"1279_CR17","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0012-365X(94)90241-0","volume":"132","author":"MV Ramana","year":"1994","unstructured":"M.V. Ramana, E.R. Scheinmerman, D. Ullman, Fractional isomorphism of graphs. Discrete Math. 132(1\u20133), 247\u2013265 (1994)","journal-title":"Discrete Math."},{"issue":"1\u20133","key":"1279_CR18","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0024-3795(98)10219-7","volume":"291","author":"HN Salas","year":"1999","unstructured":"H.N. Salas, Greshgorin\u2019s theorem for matrices of operators. Linear Algebra Appl. 291(1\u20133), 15\u201336 (1999)","journal-title":"Linear Algebra Appl."},{"issue":"11","key":"1279_CR19","doi-asserted-by":"publisher","first-page":"3671","DOI":"10.1007\/s00034-015-0030-8","volume":"34","author":"H Shang","year":"2015","unstructured":"H. Shang, F. Kang, C. Xu, G. Chen, S. Zhang, The SVE method for regular graph isomorphism identification. Circuits Syst. Signal Process. 34(11), 3671\u20133680 (2015)","journal-title":"Circuits Syst. Signal Process."},{"key":"1279_CR20","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1016\/j.phpro.2012.03.308","volume":"25","author":"L Tian","year":"2012","unstructured":"L. Tian, C. Liu, J. Xie, A partition method for graph isomorphism. Phys. Proc. 25, 1761\u20131768 (2012)","journal-title":"Phys. Proc."}],"container-title":["Circuits, Systems, and Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-019-01279-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00034-019-01279-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-019-01279-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,3]],"date-time":"2020-10-03T23:05:03Z","timestamp":1601766303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00034-019-01279-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,5]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["1279"],"URL":"https:\/\/doi.org\/10.1007\/s00034-019-01279-8","relation":{},"ISSN":["0278-081X","1531-5878"],"issn-type":[{"type":"print","value":"0278-081X"},{"type":"electronic","value":"1531-5878"}],"subject":[],"published":{"date-parts":[[2019,10,5]]},"assertion":[{"value":"31 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}