{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T05:47:31Z","timestamp":1740894451386,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540653844"},{"type":"electronic","value":"9783540493822"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/978-3-540-49382-2_28","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T04:37:34Z","timestamp":1294461454000},"page":"295-306","source":"Crossref","is-referenced-by-count":0,"title":["On the Complexity of Counting the Number of Vertices Moved by Graph Automorphisms"],"prefix":"10.1007","author":[{"given":"Antoni","family":"Lozano","sequence":"first","affiliation":[]},{"given":"Vijay","family":"Raghavan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"28_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1006\/inco.1996.0097","volume":"131","author":"M. Agrawal","year":"1996","unstructured":"Agrawal, M., Arvind, V.: A note on decision versus search for graph isomorphism. Information and Computation\u00a0131(2), 179\u2013189 (1996)","journal-title":"Information and Computation"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/BFb0028559","volume-title":"STACS 98","author":"V. Arvind","year":"1998","unstructured":"Arvind, V., Beigel, R., Lozano, A.: The complexity of modular graph automorphism. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 172\u2013182. Springer, Heidelberg (1998)"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1145\/200836.200880","volume":"43","author":"M. Blum","year":"1995","unstructured":"Blum, M., Kannan, S.: Designing programs that check their work. Journal of the ACM\u00a043, 269\u2013291 (1995)","journal-title":"Journal of the ACM"},{"key":"28_CR4","volume-title":"Permutation Groups","author":"J.D. Dixon","year":"1991","unstructured":"Dixon, J.D., Mortimer, B.: Permutation Groups. Springer, New York (1991)"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-11493-9","volume-title":"Group-Theoretic Algorithms and Graph Isomorphism","author":"C. Hoffmann","year":"1982","unstructured":"Hoffmann, C.: Group-Theoretic Algorithms and Graph Isomorphism. In: Hoffmann, C.M. (ed.) Group-Theoretic Algorithms and Graph Isomorphism. LNCS, vol.\u00a0136. Springer, Heidelberg (1982)"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"K\u00f6bler, J., Sch\u00f6ning, U., Tor\u00e1n, J.: The graph isomorphism problem: its structural complexity. Birkh\u00e4user, Boston (1993)","DOI":"10.1007\/978-1-4612-0333-9"},{"key":"28_CR7","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/321864.321877","volume":"22","author":"R. Ladner","year":"1975","unstructured":"Ladner, R.: On the structure of polynomial-time reducibilities. Journal of the Assoc. Comput. Mach.\u00a022, 155\u2013171 (1975)","journal-title":"Journal of the Assoc. Comput. Mach."},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Lozano, A., Tor\u00e1n, J.: On the nonuniform complexity of the graph isomorphism problem. In: Proceedings of the 7th Structure in Complexity Theory Conference, pp. 118\u2013129 (1992)","DOI":"10.1109\/SCT.1992.215387"},{"issue":"1","key":"28_CR9","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1137\/0210002","volume":"10","author":"A. Lubiw","year":"1981","unstructured":"Lubiw, A.: Some NP-complete problems similar to graph isomorphism. SIAM Journal of Computing\u00a010(1), 11\u201321 (1981)","journal-title":"SIAM Journal of Computing"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"E. Luks","year":"1982","unstructured":"Luks, E.: Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. System Sci.\u00a025, 42\u201365 (1982)","journal-title":"J. Comput. System Sci."},{"key":"28_CR11","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 the graph isomorphism counting problem. Information Processing Letters\u00a08, 131\u2013132 (1979)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-49382-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T14:54:01Z","timestamp":1740840841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-49382-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540653844","9783540493822"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-49382-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}