{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:36:22Z","timestamp":1725474982430},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540496946"},{"type":"electronic","value":"9783540496960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940128_46","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T00:57:35Z","timestamp":1164761855000},"page":"449-459","source":"Crossref","is-referenced-by-count":3,"title":["On Isomorphism and Canonization of Tournaments and Hypertournaments"],"prefix":"10.1007","author":[{"given":"V.","family":"Arvind","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bireswar","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Partha","family":"Mukhopadhyay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"46_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0021-8693(82)90323-4","volume":"79","author":"L. Babai","year":"1982","unstructured":"Babai, L., Cameron, P.J., P\u00e1lfy, P.P.: On the order of primitive groups with restricted nonabelian composition factors. Journal of Algebra\u00a079, 161\u2013168 (1982)","journal-title":"Journal of Algebra"},{"doi-asserted-by":"crossref","unstructured":"Babai, L., Luks, E.M.: Canonical labeling of graphs. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pp. 171\u2013183 (1983)","key":"46_CR2","DOI":"10.1145\/800061.808746"},{"key":"46_CR3","doi-asserted-by":"crossref","first-page":"775","DOI":"10.2140\/pjm.1963.13.775","volume":"13","author":"W. Feit","year":"1963","unstructured":"Feit, W., Thompson, J.: Solvability of groups of odd order. Pacific Journal of Mathematics\u00a013, 775\u20131029 (1963)","journal-title":"Pacific Journal of Mathematics"},{"issue":"4","key":"46_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/(SICI)1097-0118(199708)25:4<277::AID-JGT5>3.0.CO;2-H","volume":"25","author":"G. Gutin","year":"1997","unstructured":"Gutin, G., Yeo, A.: Hamiltonian Paths and Cycles in Hypertournaments. Journal of Graph Theory\u00a025(4), 277\u2013286 (1997)","journal-title":"Journal of Graph Theory"},{"key":"46_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0333-9","volume-title":"The Graph Isomorphism Problem: Its Structural Complexity","author":"J. K\u00f6bler","year":"1993","unstructured":"K\u00f6bler, J., Sch\u00f6ning, U., Tor\u00e1n, J.: The Graph Isomorphism Problem: Its Structural Complexity. Birkh\u00e4user, Boston (1993)"},{"key":"46_CR6","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1090\/S0894-0347-99-00288-X","volume":"12","author":"M. Liebeck","year":"1999","unstructured":"Liebeck, M., Shalev, A.: Simple groups, permutation groups and probability. Journal of Amer. Math. Soc.\u00a012, 497\u2013520 (1999)","journal-title":"Journal of Amer. Math. Soc."},{"key":"46_CR7","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1090\/dimacs\/011\/11","volume":"11","author":"E.M. Luks","year":"1993","unstructured":"Luks, E.M.: Permutation groups and polynomial time computations. DIMACS Series in Discrete Mathematics and Theoretical Computer Science\u00a011, 139\u2013175 (1993)","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"46_CR8","first-page":"652","volume-title":"Proc. 31st ACM Symposium on Theory of Computing","author":"E.M. Luks","year":"1999","unstructured":"Luks, E.M.: Hypergraph isomorphism and structural equivalence of boolean functions. In: Proc. 31st ACM Symposium on Theory of Computing, pp. 652\u2013658. ACM Press, New York (1999)"},{"key":"46_CR9","volume-title":"Finite Permutation Groups","author":"H. Wielandt","year":"1964","unstructured":"Wielandt, H.: Finite Permutation Groups. Acad. Press, New York (1964)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940128_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:49:58Z","timestamp":1619495398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940128_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496946","9783540496960"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11940128_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}