{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T04:51:12Z","timestamp":1776919872602,"version":"3.51.2"},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1982,8,1]],"date-time":"1982-08-01T00:00:00Z","timestamp":397008000000},"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":11308,"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":[[1982,8]]},"DOI":"10.1016\/0022-0000(82)90009-5","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"42-65","source":"Crossref","is-referenced-by-count":370,"title":["Isomorphism of graphs of bounded valence can be tested in polynomial time"],"prefix":"10.1016","volume":"25","author":[{"given":"Eugene M.","family":"Luks","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(82)90009-5_BIB1","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1090\/S0025-5718-1975-0367030-3","article-title":"An algorithm for finding the blocks of a permutation group","volume":"29","author":"Atkinson","year":"1975","journal-title":"Math. Comp."},{"key":"10.1016\/0022-0000(82)90009-5_BIB2","series-title":"Monte-Carlo algorithms in graph isomorphism testing","author":"Babai","year":"1979"},{"key":"10.1016\/0022-0000(82)90009-5_BIB3","series-title":"Proceedings Conf. on Fund. Comp. Thy.","article-title":"Moderately exponential bound for graph isomorphism","author":"Babai","year":"1981"},{"key":"10.1016\/0022-0000(82)90009-5_BIB4","unstructured":"L. Babai, P. J. Cameron, and P. P. P\u00e1lfy, On the order of primitive permutation groups with bounded nonabelian composition factors, to appear. 5.|L. Babai and E. Luks, A subexponential algorithm for tournament isomorphism, to appear."},{"key":"10.1016\/0022-0000(82)90009-5_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1112\/blms\/13.1.1","article-title":"Finite permutation groups and finite simple groups","volume":"13","author":"Cameron","year":"1981","journal-title":"Bull. London Math. Soc."},{"key":"10.1016\/0022-0000(82)90009-5_BIB6","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0021-8693(64)90030-4","article-title":"The Sylow 2-subgroups of the finite classical groups","volume":"1","author":"Carter","year":"1964","journal-title":"J. Algebra"},{"key":"10.1016\/0022-0000(82)90009-5_BIB7","series-title":"Tech. Report 80-426","article-title":"A Subexponential Algorithm for Trivalent Graph Isomorphism","author":"Furst","year":"1980"},{"key":"10.1016\/0022-0000(82)90009-5_BIB8","series-title":"21st IEEE Symp. on Foundations of Comp. Sci.","first-page":"36","article-title":", Polynomial-time algorithms for permutation groups","author":"Furst","year":"1980"},{"key":"10.1016\/0022-0000(82)90009-5_BIB9","series-title":"The Theory of Groups","author":"Hall","year":"1959"},{"key":"10.1016\/0022-0000(82)90009-5_BIB10","series-title":"Proc. 12th Symp. Thy. Comp.","first-page":"244","article-title":"Testing isomorphism of cone graphs","author":"Hoffman","year":"1980"},{"key":"10.1016\/0022-0000(82)90009-5_BIB11","series-title":"Endliche Gruppen I","author":"Huppert","year":"1967"},{"key":"10.1016\/0022-0000(82)90009-5_BIB12","unstructured":"P. Klingsberg, E. Luks, Succinct certificates for a class of graphs, to appear."},{"key":"10.1016\/0022-0000(82)90009-5_BIB13","article-title":"The beacon set approach to graph isomorphism","volume":"9","author":"Lipton","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(82)90009-5_BIB14","series-title":"21st IEEE Symp. Found. Comp. Sci.","first-page":"42","article-title":"Isomorphism of graphs of bounded valence can be tested in polynomial time","author":"Luks","year":"1980"},{"key":"10.1016\/0022-0000(82)90009-5_BIB15","unstructured":"E. Luks, The complexity of permutation group problems, to appear."},{"key":"10.1016\/0022-0000(82)90009-5_BIB16","unstructured":"E. Luks, A faster algorithm for trivalent graph isomorphism, to appear."},{"key":"10.1016\/0022-0000(82)90009-5_BIB17","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/0022-0000(79)90043-6","article-title":"Graph isomorphism, general remarks","volume":"18","author":"Miller","year":"1979","journal-title":"J. Comput System Sci."},{"key":"10.1016\/0022-0000(82)90009-5_BIB18","series-title":"Proc. 10th Symp. Thy. Comp.","first-page":"51","article-title":"On the nlog n isomorphism technique","author":"Miller","year":"1978"},{"key":"10.1016\/0022-0000(82)90009-5_BIB19","unstructured":"P. P. P\u00e1lfy, A polynomial bound for the orders of primitive solvable groups, to appear."},{"key":"10.1016\/0022-0000(82)90009-5_BIB20","series-title":"The Santa Cruz Conference on Finite Groups","first-page":"319","article-title":"Representations in characteristic p","author":"Scott","year":"1980"},{"key":"10.1016\/0022-0000(82)90009-5_BIB21","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/BF01117534","article-title":"Graphs and finite permutation groups","volume":"95","author":"Sims","year":"1967","journal-title":"Math. Z."},{"key":"10.1016\/0022-0000(82)90009-5_BIB22","series-title":"Computational Problems in Abstract Algebra","first-page":"169","article-title":"Computational methods for permutation groups","author":"Sims","year":"1970"},{"key":"10.1016\/0022-0000(82)90009-5_BIB23","first-page":"108","article-title":"Some Group-Theoretic Algorithms","author":"Sims","year":"1978"},{"key":"10.1016\/0022-0000(82)90009-5_BIB24","first-page":"529","article-title":"Sylow p-subgroups of the classical groups over finite fields with characteristic prime to p","volume":"6","author":"Weir","year":"1955"},{"key":"10.1016\/0022-0000(82)90009-5_BIB25","series-title":"Finite Permutation Groups","author":"Wielandt","year":"1964"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900095?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900095?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:50:12Z","timestamp":1550325012000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000082900095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,8]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,8]]}},"alternative-id":["0022000082900095"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(82)90009-5","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1982,8]]}}}