{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T07:29:09Z","timestamp":1773646149364,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,10,16]],"date-time":"2012-10-16T00:00:00Z","timestamp":1350345600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Adv Comput Math"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s10444-012-9281-0","type":"journal-article","created":{"date-parts":[[2012,10,17]],"date-time":"2012-10-17T19:58:31Z","timestamp":1350503911000},"page":"311-325","source":"Crossref","is-referenced-by-count":22,"title":["An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants"],"prefix":"10.1007","volume":"39","author":[{"given":"Matthias","family":"Dehmer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Grabner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abbe","family":"Mowshowitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Emmert-Streib","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,16]]},"reference":[{"key":"9281_CR1","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF01259368","volume":"1","author":"M Abdulrahim","year":"1998","unstructured":"Abdulrahim, M., Misra, M.: A graph isomorphism algorithm for object recognition. Pattern Anal. Appl. 1, 189\u2013201 (1998)","journal-title":"Pattern Anal. Appl."},{"key":"9281_CR2","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley (1974)"},{"key":"9281_CR3","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF01166951","volume":"8","author":"AT Balaban","year":"1991","unstructured":"Balaban, A.T., Balaban, T.S.: New vertex invariants and topological indices of chemical graphs based on information on distances. J. Math. Chem. 8, 383\u2013397 (1991)","journal-title":"J. Math. Chem."},{"key":"9281_CR4","unstructured":"Balaban, A.T., Ivanciuc, O.: Historical development of topological indices. In: Devillers, J., Balaban, A.T. (eds.) Topological Indices and Related Descriptors in QSAR and QSPAR, pp. 21\u201357. Gordon and Breach Science Publishers. Amsterdam, The Netherlands (1999)"},{"key":"9281_CR5","volume-title":"Information Theoretic Indices for Characterization of Chemical Structures","author":"D Bonchev","year":"1983","unstructured":"Bonchev, D.: Information Theoretic Indices for Characterization of Chemical Structures. Research Studies Press, Chichester (1983)"},{"key":"9281_CR6","doi-asserted-by":"crossref","unstructured":"Bonchev, D.: Information theoretic measures of complexity. In: Meyers, R. (ed.) Encyclopedia of Complexity and System Science, vol.\u00a05, pp. 4820\u20134838. Springer (2009)","DOI":"10.1007\/978-0-387-30440-3_285"},{"issue":"2","key":"9281_CR7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1002\/jcc.540020202","volume":"2","author":"D Bonchev","year":"1981","unstructured":"Bonchev, D., Mekenyan, O., Trinajsti\u0107, N.: Isomer discrimination by topological information approach. J. Comput. Chem. 2(2), 127\u2013148 (1981)","journal-title":"J. Comput. Chem."},{"key":"9281_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/b136300","volume-title":"Complexity in Chemistry, Biology, and Ecology. Mathematical and Computational Chemistry","author":"D Bonchev","year":"2005","unstructured":"Bonchev, D., Rouvray, D.H.: Complexity in Chemistry, Biology, and Ecology. Mathematical and Computational Chemistry. Springer, New York, NY, USA (2005)"},{"key":"9281_CR9","doi-asserted-by":"crossref","first-page":"4517","DOI":"10.1063\/1.434593","volume":"67","author":"D Bonchev","year":"1977","unstructured":"Bonchev, D., Trinajsti\u0107, N.: Information theory, distance matrix and molecular branching. J. Chem. Phys. 67, 4517\u20134533 (1977)","journal-title":"J. Chem. Phys."},{"key":"9281_CR10","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D Conte","year":"2004","unstructured":"Conte, D., Foggia, F., Sansone, C., Vento, M.: Thirty years of graph matching in pattern regocnition. Int. J. Pattern Recogn. 18, 265\u2013298 (2004)","journal-title":"Int. J. Pattern Recogn."},{"key":"9281_CR11","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/321556.321562","volume":"17","author":"DG Corneil","year":"1970","unstructured":"Corneil, D.G., Gotlieb, C.C.: An efficient algorithm for graph isomorphism. J. ACM 17, 51\u201364 (1970)","journal-title":"J. ACM"},{"key":"9281_CR12","volume-title":"Spectra of graphs. theory and application","author":"DM Cvetkovi\u0107","year":"1980","unstructured":"Cvetkovi\u0107, D.M., Doob, M., Sachs, H.: Spectra of graphs. theory and application. Deutscher Verlag der Wissenschaften, Berlin, Germany (1980)"},{"key":"9281_CR13","doi-asserted-by":"crossref","unstructured":"Darga, P.T., Sakallah, K.A., Markov, I.L.: Faster symmetry discovery using sparsity of symmetries. In: Proceedings of the 45st Design Automation Conference, Anaheim, California, pp. 149\u2013154 (2008)","DOI":"10.1145\/1391469.1391509"},{"key":"9281_CR14","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ins.2010.08.041","volume":"1","author":"M Dehmer","year":"2011","unstructured":"Dehmer, M., Mowshowitz, A.: A history of graph entropy measures. Inform. Sci. 1, 57\u201378 (2011)","journal-title":"Inform. Sci."},{"issue":"7","key":"9281_CR15","doi-asserted-by":"crossref","first-page":"e11393","DOI":"10.1371\/journal.pone.0011393","volume":"57","author":"M Dehmer","year":"2010","unstructured":"Dehmer, M., M\u00fcller, L., Graber, A.: New polynomial-based molecular descriptors with low degeneracy. PLoS ONE 5(7), e11393 (2010)","journal-title":"PLoS ONE"},{"key":"9281_CR16","unstructured":"Dehmer, M., Varmuza, K.: On aspects of the degeneracy of topological indices. In: Enachescu, F., Filip, F.G., Iantovics, B. (eds.) Advanced Computational Technologies. Romanian Academy Press (2012, in press)"},{"key":"9281_CR17","doi-asserted-by":"crossref","first-page":"1655","DOI":"10.1021\/ci900060x","volume":"49","author":"M Dehmer","year":"2009","unstructured":"Dehmer, M., Varmuza, K., Borgert, S., Emmert-Streib, F.: On entropy-based molecular descriptors: Statistical analysis of real and synthetic chemical structures. J. Chem. Inf. Model. 49, 1655\u20131663 (2009)","journal-title":"J. Chem. Inf. Model."},{"key":"9281_CR18","doi-asserted-by":"crossref","unstructured":"Devillers, J., Balaban, A.T.: Topological Indices and Related Descriptors in QSAR and QSPR. Gordon and Breach Science Publishers. Amsterdam, The Netherlands (1999)","DOI":"10.1201\/9781482296945"},{"key":"9281_CR19","volume-title":"Molecular Topology","author":"MV Diudea","year":"2001","unstructured":"Diudea, M.V., Gutman, I., J\u00e4ntschi, L.: Molecular Topology. Nova Publishing, New York, NY, USA (2001)"},{"key":"9281_CR20","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1002\/cplx.20363","volume":"16","author":"MV Diudea","year":"2011","unstructured":"Diudea, M.V., Ili\u0107, A., Varmuza, K., Dehmer, M.: Network analysis using a novel highly discriminating topological index. Complexity 16, 32\u201339 (2011)","journal-title":"Complexity"},{"key":"9281_CR21","doi-asserted-by":"crossref","first-page":"e34,523","DOI":"10.1371\/annotation\/4f3cfa51-aac6-4ffe-80f1-5ec467921edd","volume":"7","author":"F Emmert-Streib","year":"2012","unstructured":"Emmert-Streib, F., Dehmer, M.: Exploring statistical and population aspects of network complexity. PLoS ONE 7, e34,523 (2012)","journal-title":"PLoS ONE"},{"key":"9281_CR22","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences. Freeman (1979)"},{"key":"9281_CR23","volume-title":"Graph Theory and Its Applications. Discrete Mathematics and its Applications","author":"JL Gross","year":"2006","unstructured":"Gross, J.L., Yellen, J.: Graph Theory and Its Applications, 2nd edn. Discrete Mathematics and its Applications. Chapman & Hall, Boca Raton (2006)","edition":"2"},{"key":"9281_CR24","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F Harary","year":"1969","unstructured":"Harary, F.: Graph Theory. Addison Wesley Publishing Company, Reading, MA, USA (1969)"},{"key":"9281_CR25","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1017\/S0963548306007620","volume":"15","author":"S Jukna","year":"2006","unstructured":"Jukna, S.: On graph complexity. Combin. Probab. Comput. 15, 855\u2013876 (2006)","journal-title":"Combin. Probab. Comput."},{"key":"9281_CR26","doi-asserted-by":"crossref","unstructured":"Junttila, T., Kaski, P.: Engineering an efficient canonical labeling tool for large and sparse graphs. In: Applegate, D., Brodat, G.S., Panario, D., Sedgewick, R. (eds.) Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithms and Combinatorics. SIAM (2007)","DOI":"10.1137\/1.9781611972870.13"},{"key":"9281_CR27","doi-asserted-by":"crossref","first-page":"2637","DOI":"10.1016\/j.physa.2008.01.015","volume":"387","author":"J Kim","year":"2008","unstructured":"Kim, J., Wilhelm, T.: What is a complex graph? Physica A 387, 2637\u20132652 (2008)","journal-title":"Physica A"},{"key":"9281_CR28","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1021\/ci9502461","volume":"36","author":"EV Konstantinova","year":"1996","unstructured":"Konstantinova, E.V.: The discrimination ability of some topological and information distance indices for graphs of unbranched hexagonal systems. J. Chem. Inf. Comput. Sci. 36, 54\u201357 (1996)","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"9281_CR29","first-page":"1227","volume":"42","author":"EV Konstantinova","year":"2002","unstructured":"Konstantinova, E.V., Skorobogatov, V.A., Vidyuk, M.V.: Applications of information theory in chemical graph theory. Indian J. Chem. A 42, 1227\u20131240 (2002)","journal-title":"Indian J. Chem. A"},{"key":"9281_CR30","first-page":"173","volume":"2","author":"A Lewis","year":"1995","unstructured":"Lewis, A.: The convex analysis of unitarily invariant matrix functions. J. Convex Anal. 2, 173\u2013183 (1995)","journal-title":"J. Convex Anal."},{"issue":"10","key":"9281_CR31","doi-asserted-by":"crossref","first-page":"1243","DOI":"10.1002\/jcc.540121012","volume":"12","author":"X Liu","year":"1991","unstructured":"Liu, X., Klein, D.J.: The graph isomorphism problem. J. Comp. Chem. 12(10), 1243\u20131251 (1991)","journal-title":"J. Comp. Chem."},{"key":"9281_CR32","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"EM Luks","year":"1982","unstructured":"Luks, E.M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Syst. Sci. 25, 42\u201349 (1982)","journal-title":"J. Comput. Syst. Sci."},{"key":"9281_CR33","first-page":"45","volume":"730","author":"BD McKay","year":"1981","unstructured":"McKay, B.D.: Graph isomorphisms. Congr. Numer. 730, 45\u201387 (1981)","journal-title":"Congr. Numer."},{"key":"9281_CR34","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1006\/jagm.1997.0898","volume":"26","author":"BD McKay","year":"1998","unstructured":"McKay, B.D.: Isomorph-free exhaustive generation. J. Algorithm 26, 306\u2013324 (1998)","journal-title":"J. Algorithm"},{"key":"9281_CR35","unstructured":"McKay, B.D.: Nauty. http:\/\/cs.anu.edu.au\/~bdm\/nauty\/ (2010)"},{"issue":"6","key":"9281_CR36","doi-asserted-by":"crossref","first-page":"1440","DOI":"10.3390\/e12061440","volume":"12","author":"A Mehler","year":"2010","unstructured":"Mehler, A., Wei\u00df, P., L\u00fccking, A.: A network model of interpersonal alignment. Entropy 12(6), 1440\u20131483 (2010). doi: 10.3390\/e12061440","journal-title":"Entropy"},{"key":"9281_CR37","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF02476948","volume":"30","author":"A Mowshowitz","year":"1968","unstructured":"Mowshowitz, A.: Entropy and the complexity of the graphs I: an index of the relative complexity of a graph. Bull. Math. Biophys. 30, 175\u2013204 (1968)","journal-title":"Bull. Math. Biophys."},{"issue":"1","key":"9281_CR38","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1093\/bioinformatics\/btq606","volume":"27","author":"LAJ M\u00fcller","year":"2011","unstructured":"M\u00fcller, L.A.J., Kugler, K.G., Dander, A., Graber, A., Dehmer, M.: QuACN\u2014an R package for analyzing complex biological networks quantitatively. Bioinformatics 27(1), 140\u2013144 (2011)","journal-title":"Bioinformatics"},{"key":"9281_CR39","unstructured":"Presa, J.L.L.: Efficient algorithms for graph isomorphism testing. Ph.D. thesis, Department of Computer Science, Universidad Rey Juan Carlos, Madrid, Spain (2009)"},{"key":"9281_CR40","unstructured":"R, software: A language and environment for statistical computing. R Development Core Team, Foundation for Statistical Computing, Vienna, Austria. www.r-project.org (2011)"},{"key":"9281_CR41","doi-asserted-by":"crossref","first-page":"6609","DOI":"10.1021\/ja00856a001","volume":"97","author":"M Randi\u0107","year":"1975","unstructured":"Randi\u0107, M.: On characterization of molecular branching. J. Am. Chem. Soc. 97, 6609\u20136615 (1975)","journal-title":"J. Am. Chem. Soc."},{"key":"9281_CR42","first-page":"53","volume":"71","author":"M Randi\u0107","year":"1998","unstructured":"Randi\u0107, M., DeAlba, L.M., Harris, F.E.: Graphs with the same detour matrix. Croat. Chem. Acta 71, 53\u201368 (1998)","journal-title":"Croat. Chem. Acta"},{"key":"9281_CR43","first-page":"93","volume-title":"QSPR\/QSAR Studies by Molecular Descriptors","author":"M Randi\u0107","year":"2001","unstructured":"Randi\u0107, M., Vracko, M., Novic, M.: Eigenvalues as molecular descriptors. In: Diudea, M.V. (ed.) QSPR\/QSAR Studies by Molecular Descriptors, pp. 93\u2013120. Nova Publishing, Huntington, NY, USA (2001)"},{"key":"9281_CR44","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1002\/jcc.540050612","volume":"5","author":"C Raychaudhury","year":"1984","unstructured":"Raychaudhury, C., Ray, S.K., Ghosh, J.J., Roy, A.B., Basak, S.C.: Discrimination of isomeric structures using information theoretic topological indices. J. Comput. Chem. 5, 581\u2013588 (1984)","journal-title":"J. Comput. Chem."},{"key":"9281_CR45","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1002\/jgt.3190010410","volume":"1","author":"R Read","year":"1977","unstructured":"Read, R., Corneil, D.: The graph isomorphism disease. J. Graph Theory 1, 339\u2013363 (1977)","journal-title":"J. Graph Theory"},{"key":"9281_CR46","doi-asserted-by":"crossref","unstructured":"Sol\u00e9, R.V., Valverde, S.: Information theory of complex networks: On evolution and architectural constraints. In: Lecture Notes in Physics, vol. 650, pp. 189\u2013207 (2004)","DOI":"10.1007\/978-3-540-44485-5_9"},{"key":"9281_CR47","unstructured":"Toda, S.: Graph isomorphism: its complexity and algorithms (abstract). In: Rangan, C.P., Raman, V., Ramanujam, R. (eds.) FSTTCS, Foundations of Software Technology and Theoretical Computer Science, 19th Conference, Chennai, India, 13\u201315 Dec 1999, Proceedings, Lecture Notes in Computer Science, vol. 1738, p. 341. Springer (1999)"},{"key":"9281_CR48","volume-title":"Handbook of Molecular Descriptors","author":"R Todeschini","year":"2002","unstructured":"Todeschini, R., Consonni, V., Mannhold, R.: Handbook of Molecular Descriptors. Wiley-VCH, Weinheim, Germany (2002)"},{"issue":"1","key":"9281_CR49","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM 23(1), 31\u201342 (1976)","journal-title":"J. ACM"},{"key":"9281_CR50","doi-asserted-by":"crossref","first-page":"1426","DOI":"10.1007\/BF02104746","volume":"29","author":"VN Zemlyachenko","year":"1985","unstructured":"Zemlyachenko, V.N., Korneenko, N.M., Tyshkevich, R.I.: Graph isomorphism problem. J. Math. Sci. 29, 1426\u20131481 (1985)","journal-title":"J. Math. Sci."}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-012-9281-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10444-012-9281-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-012-9281-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,14]],"date-time":"2020-07-14T22:00:46Z","timestamp":1594764046000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10444-012-9281-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,16]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["9281"],"URL":"https:\/\/doi.org\/10.1007\/s10444-012-9281-0","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,16]]}}}