{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:04:38Z","timestamp":1750694678443},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1984,9,1]],"date-time":"1984-09-01T00:00:00Z","timestamp":462844800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1984,9]]},"DOI":"10.1016\/0196-6774(84)90015-4","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"345-362","source":"Crossref","is-referenced-by-count":5,"title":["A non-factorial algorithm for canonical numbering of a graph"],"prefix":"10.1016","volume":"5","author":[{"given":"Derek","family":"Corneil","sequence":"first","affiliation":[]},{"given":"Mark","family":"Goldberg","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(84)90015-4_BIB1","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1137\/0209047","article-title":"Random graph isomorphism","volume":"9","author":"Babai","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(84)90015-4_BIB2","series-title":"Proceedings, Fourteenth Annual ACM Symposium on Theory of Computing","first-page":"310","article-title":"Isomorphism of graphs with bounded eigenvalue multiplicity","author":"Babai","year":"1982"},{"key":"10.1016\/0196-6774(84)90015-4_BIB3","series-title":"Proceedings, Fifteenth Annual ACM Symposium on Theory of Computing","first-page":"171","article-title":"Canonical labeling of graphs","author":"Babai","year":"1983"},{"key":"10.1016\/0196-6774(84)90015-4_BIB4","series-title":"Problems Polynomially Equivalent to Graph Isomorphism","author":"Booth","year":"1979"},{"key":"10.1016\/0196-6774(84)90015-4_BIB5","article-title":"Graph Isomorphism","author":"Corneil","year":"1968"},{"key":"10.1016\/0196-6774(84)90015-4_BIB6","series-title":"Proceedings, Thirteenth Southeastern Conference on Combinatorics, Graph Theory and Computing","first-page":"181","article-title":"On graph certificates","volume":"35","author":"Corneil","year":"1982"},{"key":"10.1016\/0196-6774(84)90015-4_BIB7","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/321556.321562","article-title":"An efficient algorithm for graph isomorphism","volume":"17","author":"Corneil","year":"1970","journal-title":"J. Assoc. Comput. Mach."},{"issue":"2","key":"10.1016\/0196-6774(84)90015-4_BIB8","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0209025","article-title":"A theoretical analysis of various heuristics for the graph isomorphism problem","volume":"9","author":"Corneil","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(84)90015-4_BIB9","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","article-title":"Complement reducible graphs","volume":"3","author":"Corneil","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0196-6774(84)90015-4_BIB10","series-title":"Finite Graphs and Networks: An Introduction with Applications","first-page":"196","author":"Edmonds","year":"1965"},{"key":"10.1016\/0196-6774(84)90015-4_BIB11","series-title":"Proceedings, Twelfth Annual ACM Symposium on Theory of Computing","first-page":"236","article-title":"A polynomial time algorithm for determining isomorphism of graphs of fixed genus","author":"Filotti","year":"1980"},{"key":"10.1016\/0196-6774(84)90015-4_BIB12","series-title":"Proceedings, Fifteenth Annual ACM Symposium on Theory of Computing","first-page":"161","article-title":"Normal forms for trivalent graphs and graphs of bounded valence","author":"F\u00fcrer","year":"1983"},{"key":"10.1016\/0196-6774(84)90015-4_BIB13","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0166-218X(83)90078-1","article-title":"A non-factorial algorithm for testing isomorphism of two graphs","volume":"6","author":"Goldberg","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0196-6774(84)90015-4_BIB14","series-title":"Complexity of Computer Computations","first-page":"131","article-title":"Isomorphism of planar graphs","author":"Hopcroft","year":"1972"},{"key":"10.1016\/0196-6774(84)90015-4_BIB15","first-page":"365","article-title":"Probabilistic analysis of a canonical numbering algorithm for graphs","volume":"34","author":"Karp","year":"1979"},{"issue":"2","key":"10.1016\/0196-6774(84)90015-4_BIB16","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1137\/0603025","article-title":"Isomorphism testing in hookup classes","volume":"3","author":"Klawe","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"2","key":"10.1016\/0196-6774(84)90015-4_BIB17","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/322123.322125","article-title":"A linear time algorithm for deciding interval graph isomorphism","volume":"36","author":"Lueker","year":"1979","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(84)90015-4_BIB18","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","article-title":"Isomorphism of graphs of bounded valence can be tested in polynomial time","volume":"25","author":"Luks","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0196-6774(84)90015-4_BIB19","series-title":"presented at Thirteenth Southeastern Conference on Combinatorics, Graph Theory and Computing","article-title":"On a moderately exponential graph isomorphism test","author":"Luks","year":"1982"},{"key":"10.1016\/0196-6774(84)90015-4_BIB20","series-title":"Proceedings, Twelfth Annual ACM Symposium on Theory of Computing","first-page":"218","article-title":"Isomorphism testing for graphs of bounded genus","author":"Miller","year":"1980"},{"key":"10.1016\/0196-6774(84)90015-4_BIB21","series-title":"Isomorphism of k-contractable graphs (a generalization of bounded valence and bounded genus)","author":"Miller","year":"1982"},{"key":"10.1016\/0196-6774(84)90015-4_BIB22","series-title":"Isomorphism of graphs which are pairwise k-separable","author":"Miller","year":"1982"},{"key":"10.1016\/0196-6774(84)90015-4_BIB23","series-title":"Proceedings, Conf. on Fundamentals of Computation Theory","article-title":"Moderately exponential bound for graph isomorphism","author":"Zemlyachenko","year":"1982"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677484900154?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677484900154?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:50:13Z","timestamp":1548744613000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677484900154"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,9]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1984,9]]}},"alternative-id":["0196677484900154"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(84)90015-4","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1984,9]]}}}