{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T21:01:41Z","timestamp":1746306101081},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03816-7_26","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T14:43:03Z","timestamp":1250692983000},"page":"295-306","source":"Crossref","is-referenced-by-count":2,"title":["Representing Groups on Graphs"],"prefix":"10.1007","author":[{"given":"Sagarmoy","family":"Dutta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piyush P.","family":"Kurur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","first-page":"743","volume-title":"43rd Annual Symposium of Foundations of Computer Science","author":"V. Arvind","year":"2002","unstructured":"Arvind, V., Kurur, P.P.: Graph Isomorphism is in SPP. In: 43rd Annual Symposium of Foundations of Computer Science, pp. 743\u2013750. IEEE, Los Alamitos (2002)"},{"key":"26_CR2","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)","DOI":"10.1145\/800061.808746"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Furst, M.L., Hopcroft, J.E., Luks, E.M.: Polynomial-time algorithms for permutation groups. In: IEEE Symposium on Foundations of Computer Science, pp. 36\u201341 (1980)","DOI":"10.1109\/SFCS.1980.34"},{"key":"26_CR4","volume-title":"The Theory of Groups","author":"M. Hall Jr.","year":"1959","unstructured":"Hall Jr., M.: The Theory of Groups, 1st edn. The Macmillan Company, New York (1959)","edition":"1"},{"key":"26_CR5","unstructured":"Joyner, W.D.: Real world applications of representation theory of non-abelian groups, http:\/\/www.usna.edu\/Users\/math\/wdj\/repn_thry_appl.htm"},{"issue":"4","key":"26_CR6","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01200427","volume":"2","author":"J. K\u00f6bler","year":"1992","unstructured":"K\u00f6bler, J., Sch\u00f6ning, U., Tor\u00e1n, J.: Graph isomorphism is low for\u00a0PP. Computational Complexity\u00a02(4), 301\u2013330 (1992)","journal-title":"Computational Complexity"},{"issue":"3","key":"26_CR7","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(79)90004-8","volume":"8","author":"R. Mathon","year":"1979","unstructured":"Mathon, R.: A note on graph isomorphism counting problem. Information Processing Letters\u00a08(3), 131\u2013132 (1979)","journal-title":"Information Processing Letters"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Sch\u00f6ning, U.: Graph isomorphism is in the low hierarchy. In: Symposium on Theoretical Aspects of Computer Science, pp. 114\u2013124 (1987)","DOI":"10.1007\/BFb0039599"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Sims, C.C.: Computational methods in the study of permutation groups. Computational problems in Abstract Algebra, 169\u2013183 (1970)","DOI":"10.1016\/B978-0-08-012975-4.50020-5"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/BFb0103126","volume":"697","author":"C.C. Sims","year":"1978","unstructured":"Sims, C.C.: Some group theoretic algorithms. Topics in Algebra\u00a0697, 108\u2013124 (1978)","journal-title":"Topics in Algebra"},{"key":"26_CR11","volume-title":"Finite Permutation Groups","author":"H. Wielandt","year":"1964","unstructured":"Wielandt, H.: Finite Permutation Groups. Academic Press, New York (1964)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T02:33:45Z","timestamp":1558492425000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}