{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T02:01:41Z","timestamp":1760061701255},"reference-count":31,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,12,1]],"date-time":"1982-12-01T00:00:00Z","timestamp":407548800000},"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":11186,"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,12]]},"DOI":"10.1016\/0022-0000(82)90015-0","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"332-359","source":"Crossref","is-referenced-by-count":11,"title":["Subcomplete generalizations of graph isomorphism"],"prefix":"10.1016","volume":"25","author":[{"given":"Christoph M.","family":"Hoffmann","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(82)90015-0_BIB1","article-title":"Monte Carlo algorithms in graph isomorphism testing","author":"Babai","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(82)90015-0_BIB2","series-title":"Proceedings, 14th STOC Symposium","article-title":"Isomorphism testing for graphs with bounded eigenvalue multiplicities","author":"Babai","year":"1982"},{"issue":"3","key":"10.1016\/0022-0000(82)90015-0_BIB3","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1137\/0207023","article-title":"Isomorphism testing for graphs, semigroups, and finite automata are polynomially equivalent problems","volume":"7","author":"Booth","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(82)90015-0_BIB4","series-title":"Tech. Report CS-77-04","article-title":"Problems Polynomially Equivalent to Graph Isomorphism","author":"Booth","year":"1979"},{"key":"10.1016\/0022-0000(82)90015-0_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0012-365X(74)80015-4","article-title":"Constructive graph labelling using double cosets","volume":"7","author":"Brown","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0022-0000(82)90015-0_BIB6","article-title":"Computational Approaches to Certain Problems in the Theory of Finite Groups","author":"Butler","year":"1979"},{"key":"10.1016\/0022-0000(82)90015-0_BIB7","article-title":"A Subexponential Algorithm for Trivalent Graph Isomorphism","author":"Furst","year":"1980"},{"key":"10.1016\/0022-0000(82)90015-0_BIB8","series-title":"Proceedings, 21st STOC","first-page":"36","article-title":"Polynomial time algorithms for permutation groups","author":"Furst","year":"1980"},{"key":"10.1016\/0022-0000(82)90015-0_BIB9","series-title":"Proceedings, 11th Annual STOC Symposium","first-page":"27","article-title":"On determining the genus of a graph in O(VO(g)) steps","author":"Filotti","year":"1979"},{"key":"10.1016\/0022-0000(82)90015-0_BIB10","series-title":"Proceedings, 12th Annual STOC Symposium","first-page":"236","article-title":"A polynomial time algorithm for determining isomorphism of graphs of fixed genus","author":"Filotti","year":"1980"},{"key":"10.1016\/0022-0000(82)90015-0_BIB11","first-page":"239","article-title":"Herstellung von Graphen mit vorgegebener abstrakter Gruppe","volume":"6","author":"Frucht","year":"1938","journal-title":"Compositio Math."},{"key":"10.1016\/0022-0000(82)90015-0_BIB12","series-title":"Computers and Intractability, a Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0022-0000(82)90015-0_BIB13","series-title":"The Theory of Groups","author":"Hall","year":"1959"},{"key":"10.1016\/0022-0000(82)90015-0_BIB14","series-title":"Proceedings, 12th Annual STOC Symposium","first-page":"244","article-title":"Testing isomorphism of cone graphs","author":"Hoffmann","year":"1980"},{"key":"10.1016\/0022-0000(82)90015-0_BIB15","article-title":"On the Complexity of Intersecting Permutation Groups and its Relationship with Graph Isomorphism","author":"Hoffmann","year":"1980"},{"key":"10.1016\/0022-0000(82)90015-0_BIB16","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0022-0000(73)80013-3","article-title":"A V log V algorithm for isomorphism of triconnected planar graphs","volume":"7","author":"Hopcroft","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(82)90015-0_BIB17","series-title":"Proceedings, 6th Annual STOC Symposium","first-page":"172","article-title":"A linear time algorithm for isomorphism of planar graphs","author":"Hopcroft","year":"1974"},{"key":"10.1016\/0022-0000(82)90015-0_BIB18","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/321864.321877","article-title":"On the structure of polynomial time reducibility","volume":"22","author":"Ladner","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(82)90015-0_BIB19","series-title":"Proceedings, 12th Annual STOC Symposium","first-page":"218","article-title":"Isomorphism for graphs embeddable on the projective plane","author":"Lichtenstein","year":"1980"},{"key":"10.1016\/0022-0000(82)90015-0_BIB20","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1137\/0210002","article-title":"Some NP-complete problems similar to graph isomorphism","volume":"10","author":"Lubiw","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(82)90015-0_BIB21","series-title":"Proceedings, 21st Annual FOCS Symposium","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)90015-0_BIB22","series-title":"presented at the summer meeting of the AMS","article-title":"The Complexity of Permutation Group Problems","author":"Luks","year":"1981"},{"key":"10.1016\/0022-0000(82)90015-0_BIB23","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0020-0190(79)90004-8","article-title":"A note on the graph isomorphism counting problem","volume":"8","author":"Mathon","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(82)90015-0_BIB24","series-title":"Proceedings, 9th STOC","first-page":"143","article-title":"Graph isomorphism, general remarks","author":"Miller","year":"1977"},{"key":"10.1016\/0022-0000(82)90015-0_BIB25","series-title":"Proceedings, 10th Annual STOC Symposium","first-page":"51","article-title":"On the nlog n isomorphism technique","author":"Miller","year":"1978"},{"key":"10.1016\/0022-0000(82)90015-0_BIB26","series-title":"Proceedings, 12th Annual STOC Symposium","first-page":"218","article-title":"Isomorphism testing for graphs of bounded genus","author":"Miller","year":"1980"},{"key":"10.1016\/0022-0000(82)90015-0_BIB27","series-title":"Proceedings of the Symposium on Applied Mathematics","first-page":"191","article-title":"Determining the onjugacy classes of a permutation group","author":"Sims","year":"1970"},{"key":"10.1016\/0022-0000(82)90015-0_BIB28","series-title":"Proceedings, 2nd ACM Symposium on Symbolic and Algebraic Manipulations","first-page":"23","article-title":"Computation with permutation groups","author":"Sims","year":"1971"},{"key":"10.1016\/0022-0000(82)90015-0_BIB29","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(82)90015-0_BIB30","series-title":"Finite Permutation Groups","author":"Wielandt","year":"1964"},{"key":"10.1016\/0022-0000(82)90015-0_BIB31","first-page":"53","article-title":"Calcul de Centralisateur d'un Groupe de Permutations","volume":"49\u201350","author":"Fontet","year":"1977","journal-title":"Bull. Soc. Math. France Mem."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900150?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900150?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:28Z","timestamp":1550325028000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000082900150"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,12]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,12]]}},"alternative-id":["0022000082900150"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(82)90015-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1982,12]]}}}