{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T15:57:34Z","timestamp":1680451054333},"reference-count":23,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1985,12,1]],"date-time":"1985-12-01T00:00:00Z","timestamp":502243200000},"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":10090,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1985,12]]},"DOI":"10.1016\/s0747-7171(85)80021-3","type":"journal-article","created":{"date-parts":[[2008,3,29]],"date-time":"2008-03-29T14:14:04Z","timestamp":1206800044000},"page":"363-381","source":"Crossref","is-referenced-by-count":19,"title":["A General backtrack algorithm for the isomorphism problem of combinatorial objects"],"prefix":"10.1016","volume":"1","author":[{"given":"G.","family":"Butler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.W.H.","family":"Lam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(85)80021-3_bib1","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0021-9800(68)80053-5","article-title":"Enumeration of latin squares with application to order 8","volume":"5","author":"Brown","year":"1968","journal-title":"J . Combin . Theor."},{"key":"10.1016\/S0747-7171(85)80021-3_bib2","series-title":"Ph.D. Thesis","article-title":"Computational approaches to certain problems in the theory of finite groups","author":"Butler","year":"1979"},{"key":"10.1016\/S0747-7171(85)80021-3_bib3","series-title":"Technical Report CS-77-04","article-title":"Problems Polynomrially Equivalent to Graph Isomorphism","author":"Booth","year":"1979"},{"key":"10.1016\/S0747-7171(85)80021-3_bib4","first-page":"159","article-title":"The complexity of combinatorial isomorphism problems II","author":"Colbourn","year":"1979","journal-title":"Proc. Ninth Manitoba Conf. on Numerical Math. and Computing"},{"issue":"2","key":"10.1016\/S0747-7171(85)80021-3_bib5","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. Comp."},{"key":"10.1016\/S0747-7171(85)80021-3_bib6","first-page":"36","article-title":"Polynomial Algorithms for Permutation Groups","author":"Furst","year":"1980","journal-title":"Proc. IEEE 21st Annual Symp . on Foundations of Computer Science"},{"key":"10.1016\/S0747-7171(85)80021-3_bib7","series-title":"Computers and Intractability\u2014A Guide to NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0747-7171(85)80021-3_bib8","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-11493-9","article-title":"Group-Theoretic Algorithms and Graph Isomorphism","volume":"136","author":"Hofman","year":"1982","journal-title":"Springer Lec. Notes Comp. Sci"},{"key":"10.1016\/S0747-7171(85)80021-3_bib9","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1145\/800119.803896","article-title":"Linear time algorithm for isomorphism of planar graphs","author":"Hopcroft","year":"1974","journal-title":"Proc. Sixth Annual ACM Symp. on the Theory of Computing"},{"key":"10.1016\/S0747-7171(85)80021-3_bib10","series-title":"Fundamentals of Data Structures","author":"Horowitz","year":"1976"},{"key":"10.1016\/S0747-7171(85)80021-3_bib11","series-title":"Pascal User Manual and Report","author":"Jensen","year":"1974"},{"key":"10.1016\/S0747-7171(85)80021-3_bib12","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0097-3165(79)90018-9","article-title":"An algorithm for computing the automorphism group of a Hadamard matrix","volume":"27","author":"Leon","year":"1979","journal-title":"J. Combin. Theor. series A"},{"key":"10.1016\/S0747-7171(85)80021-3_bib13","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1090\/S0025-5718-1980-0572868-5","article-title":"On an algorithm for finding a base and strong generating set for a group given by generating permutations","volume":"35","author":"Leon","year":"1980","journal-title":"Math. Comp."},{"key":"10.1016\/S0747-7171(85)80021-3_bib14","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1109\/TIT.1982.1056498","article-title":"Computing automorphism groups of error-correcting codes","author":"Leon","year":"1982","journal-title":"IEEE Trans. Inform. Theory IT-28"},{"key":"10.1016\/S0747-7171(85)80021-3_bib15","series-title":"Computational Group Theory (Proc. LMS Symp. on Computational Group Theory, Durham, England, 1982)","first-page":"321","article-title":"Computing automorphism groups of combinatorial objects","author":"Leon","year":"1984"},{"key":"10.1016\/S0747-7171(85)80021-3_bib16","series-title":"M.Sc. Thesis","article-title":"Backtrack Progranmning and the Graph Isomorphism Problem","author":"McKay","year":"1976"},{"key":"10.1016\/S0747-7171(85)80021-3_bib17","first-page":"223","article-title":"Computing Automorphisms and Canonical Labellings of Graphs, (Internat. Conf. on Combinatorial Math., Canberra, 1977)","volume":"686","author":"McKay","year":"1977","journal-title":"Springer Lec. Notes Comp. Sci."},{"key":"10.1016\/S0747-7171(85)80021-3_bib18","first-page":"65","article-title":"Backtrack programming and isomorph rejection on ordered subsets","volume":"5","author":"McKay","year":"1978","journal-title":"Ars Combinatoria"},{"key":"10.1016\/S0747-7171(85)80021-3_bib19","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0012-365X(79)90113-4","article-title":"Hadamard equivalence via graph isomorphism","volume":"27","author":"McKay","year":"1979","journal-title":"Discrete Math"},{"key":"10.1016\/S0747-7171(85)80021-3_bib20","first-page":"45","article-title":"Practical graph isomorphism","volume":"1","author":"McKay","year":"1981"},{"key":"10.1016\/S0747-7171(85)80021-3_bib21","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1002\/jgt.3190010410","article-title":"The graph isomorphism disease","volume":"1","author":"Read","year":"1977","journal-title":"J. Graph Theor."},{"key":"10.1016\/S0747-7171(85)80021-3_bib22","first-page":"191","article-title":"Determining the conjugacy classes of a permutation group","volume":"4","author":"Sims","year":"1971","journal-title":"SIAM-AMS Proc."},{"key":"10.1016\/S0747-7171(85)80021-3_bib23","series-title":"Proc. Second Symp, on Symbolic and Algebraic Manipulation","first-page":"23","article-title":"Computation with permutation groups","author":"Sims","year":"1971"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717185800213?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717185800213?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,30]],"date-time":"2018-12-30T17:54:13Z","timestamp":1546192453000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717185800213"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,12]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,12]]}},"alternative-id":["S0747717185800213"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(85)80021-3","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1985,12]]}}}