{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:56:08Z","timestamp":1725544568236},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540323013"},{"type":"electronic","value":"9783540322887"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11672142_31","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T08:27:54Z","timestamp":1141115274000},"page":"384-395","source":"Crossref","is-referenced-by-count":5,"title":["On Hypergraph and Graph Isomorphism with Bounded Color Classes"],"prefix":"10.1007","author":[{"given":"V.","family":"Arvind","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"K\u00f6bler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","first-page":"13","volume-title":"Proc. 20th Annual IEEE Conference on Computational Complexity","author":"V. Arvind","year":"2005","unstructured":"Arvind, V., Kurur, P., Vijayaraghavan, T.: Bounded color multiplicity graph isomorphism is in the #L hierarchy. In: Proc. 20th Annual IEEE Conference on Computational Complexity, pp. 13\u201327. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Babai, L., Luks, E.: Canonical labeling of graphs. In: Proc. 15th ACM Symposium on Theory of Computing, pp. 171\u2013183 (1983)","DOI":"10.1145\/800061.808746"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF01374526","volume":"25","author":"G. Buntrock","year":"1992","unstructured":"Buntrock, G., Damm, C., Hertrampf, U., Meinel, C.: Structure and importance of logspace-MOD classes. Mathematical Systems Theory\u00a025, 223\u2013237 (1992)","journal-title":"Mathematical Systems Theory"},{"issue":"4","key":"31_CR4","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/BF01305232","volume":"12","author":"J. Cai","year":"1992","unstructured":"Cai, J., F\u00fcrer, M., Immerman, N.: An optimal lower bound on the number of variables for graph identifications. Combinatorica\u00a012(4), 389\u2013410 (1992)","journal-title":"Combinatorica"},{"key":"31_CR5","first-page":"36","volume-title":"Proc. 21st IEEE Symposium on the Foundations of Computer Science","author":"M. Furst","year":"1980","unstructured":"Furst, M., Hopcroft, J., Luks, E.: Polynomial time algorithms for permutation groups. In: Proc. 21st IEEE Symposium on the Foundations of Computer Science, pp. 36\u201341. IEEE Computer Society Press, Los Alamitos (1980)"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/S0022-0000(03)00042-4","volume":"66","author":"B. Jenner","year":"2003","unstructured":"Jenner, B., K\u00f6bler, J., McKenzie, P., Tor\u00e1n, J.: Completeness results for graph isomorphism. Journal of Computer and System Sciences\u00a066, 549\u2013566 (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"31_CR7","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 bounded valence can be tested in polynomial time. Journal of Computer and System Sciences\u00a025, 42\u201365 (1982)","journal-title":"Journal of Computer and System Sciences"},{"key":"31_CR8","first-page":"292","volume-title":"Proc. 27th IEEE Symposium on the Foundations of Computer Science","author":"E. Luks","year":"1986","unstructured":"Luks, E.: Parallel algorithms for permutation groups and graph isomorphism. In: Proc. 27th IEEE Symposium on the Foundations of Computer Science, pp. 292\u2013302. IEEE Computer Society Press, Los Alamitos (1986)"},{"key":"31_CR9","first-page":"652","volume-title":"Proc. 31st ACM Symposium on Theory of Computing","author":"E. Luks","year":"1999","unstructured":"Luks, E.: 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":"31_CR10","first-page":"376","volume-title":"Proc. 37th ACM Symposium on Theory of Computing","author":"O. Reingold","year":"2005","unstructured":"Reingold, O.: Undirected st-connectivity in log-space. In: Proc. 37th ACM Symposium on Theory of Computing, pp. 376\u2013385. ACM Press, New York (2005)"},{"issue":"5","key":"31_CR11","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1137\/S009753970241096X","volume":"33","author":"J. Tor\u00e1n","year":"2004","unstructured":"Tor\u00e1n, J.: On the hardness of graph isomorphism. SIAM Journal on Computing\u00a033(5), 1093\u20131108 (2004)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T07:04:13Z","timestamp":1552374253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11672142_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}