{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T14:16:28Z","timestamp":1768313788696,"version":"3.49.0"},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1979,4,1]],"date-time":"1979-04-01T00:00:00Z","timestamp":291772800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12526,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1979,4]]},"DOI":"10.1016\/0022-0000(79)90043-6","type":"journal-article","created":{"date-parts":[[2003,12,5]],"date-time":"2003-12-05T11:41:56Z","timestamp":1070624516000},"page":"128-142","source":"Crossref","is-referenced-by-count":46,"title":["Graph isomorphism, general remarks"],"prefix":"10.1016","volume":"18","author":[{"given":"Gary L.","family":"Miller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(79)90043-6_BIB1","first-page":"141","article-title":"Permutation groups and almost regular graphs","volume":"8","author":"Babai","year":"1973","journal-title":"Studia Sci. Math. Hungar."},{"key":"10.1016\/0022-0000(79)90043-6_BIB2","series-title":"Algebraic Graph Theory","author":"Biggs","year":"1974"},{"key":"10.1016\/0022-0000(79)90043-6_BIB3","unstructured":"K. S. BOOTH, Isomorphism testing of graphs, semisroups and finite automata are polynomially equivalent problems, SIAM J. Comput., in press."},{"key":"10.1016\/0022-0000(79)90043-6_BIB4","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1145\/1008354.1008358","article-title":"A four-gadget","volume":"9","author":"Carter","year":"1977","journal-title":"SIGACT News"},{"key":"10.1016\/0022-0000(79)90043-6_BIB5","series-title":"Conference Record of the Third Annual ACM Symposium on the Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1970"},{"key":"10.1016\/0022-0000(79)90043-6_BIB6","unstructured":"A. COBHAM, The intrinsic computational difficulty of functions, int \u201cProceedings of the 1964 International Congress for Logic, Methodology, and the Philosophy of Science,\u201d, pp. 24\u201330, North-Holland, Amsterdam."},{"key":"10.1016\/0022-0000(79)90043-6_BIB7","unstructured":"D. CORNEIL AND D. KIRKPATRICK, private communications."},{"key":"10.1016\/0022-0000(79)90043-6_BIB8","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0095-8956(74)90070-7","article-title":"Automorphisms of graph and coverings","volume":"16","author":"Djokovi\u0107","year":"1974","journal-title":"J. Combinatorial Theory B"},{"key":"10.1016\/0022-0000(79)90043-6_BIB9","article-title":"On regular graphs V","author":"Djokovi\u0107","year":"1979","journal-title":"J. Combinatorial Theory B"},{"key":"10.1016\/0022-0000(79)90043-6_BIB10","series-title":"Tech. Report No. 20","article-title":"Regular Groups of Automorphisms for Cubic Graphs","author":"Djokovi\u0107","year":"1977"},{"key":"10.1016\/0022-0000(79)90043-6_BIB11","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0022-0000(79)90043-6_BIB12","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1215\/ijm\/1256054991","article-title":"On full embeddings of categories of algebras","volume":"10","author":"Hedrlin","year":"1966","journal-title":"Illinois J. Math."},{"key":"10.1016\/0022-0000(79)90043-6_BIB13","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","article-title":"Dividing a graph into triconnected components","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM Jr Comput."},{"key":"10.1016\/0022-0000(79)90043-6_BIB14","series-title":"Complexity of Computer Computations","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0022-0000(79)90043-6_BIB15","doi-asserted-by":"crossref","DOI":"10.1016\/S0022-0000(76)80043-8","article-title":"Riemann's hypothesis and test for primality","volume":"13","author":"Miller","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(79)90043-6_BIB16","series-title":"Conference Record of the 10th Annual ACM Symposium on the Theory of Computing","first-page":"51","article-title":"On the nlogn isomorphism technique","author":"Miller","year":"1978"},{"key":"10.1016\/0022-0000(79)90043-6_BIB17","series-title":"The Theory of Groups: An Introduction","author":"Rotman","year":"1965"},{"key":"10.1016\/0022-0000(79)90043-6_BIB18","first-page":"459","article-title":"A family of cubical graphs","volume":"43","author":"Tutte","year":"1947"},{"key":"10.1016\/0022-0000(79)90043-6_BIB19","doi-asserted-by":"crossref","first-page":"621","DOI":"10.4153\/CJM-1959-057-2","article-title":"On the symmetry of cubic graphs","volume":"11","author":"Tutte","year":"1959","journal-title":"Canad. J. Math."},{"key":"10.1016\/0022-0000(79)90043-6_BIB20","series-title":"Connectivity in Graphs","author":"Tutte","year":"1966"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000079900436?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000079900436?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T18:55:58Z","timestamp":1585335358000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000079900436"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,4]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1979,4]]}},"alternative-id":["0022000079900436"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(79)90043-6","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1979,4]]}}}