{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T02:45:31Z","timestamp":1725936331368},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319724522"},{"type":"electronic","value":"9783319724539"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-72453-9_27","type":"book-chapter","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T04:35:54Z","timestamp":1513744554000},"page":"325-329","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Testing Isomorphism of Graphs of Bounded Eigenvalue Multiplicity"],"prefix":"10.1007","author":[{"given":"Takunari","family":"Miyazaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/s00453-013-9787-y","volume":"71","author":"V Arvind","year":"2015","unstructured":"Arvind, V., Das, B., K\u00f6bler, J., Toda, S.: Colored hypergraph isomorphism is fixed parameter tractable. Algorithmica 71, 120\u2013138 (2015)","journal-title":"Algorithmica"},{"key":"27_CR2","unstructured":"Babai, L.: Monte carlo algorithms in graph isomorphism testing. Technical Report 79\u201310, D\u00e9partment de math\u00e9matiques et de statistique, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al (1979)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Babai, L., Grigoryev, Yu, D., Mount, D.M.: Isomorphism of graphs with bounded eigenvalue multiplicity. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, San Francisco, 5\u20137 May 1982, pp. 310\u2013324. ACM, New York (1982)","DOI":"10.1145\/800070.802206"},{"key":"27_CR4","doi-asserted-by":"crossref","first-page":"1392","DOI":"10.1016\/j.ejc.2008.11.007","volume":"30","author":"E Bannai","year":"2009","unstructured":"Bannai, E., Bannai, E.: A survey on spherical designs and algebraic combinatorics on spheres. Eur. J. Combin. 30, 1392\u20131425 (2009)","journal-title":"Eur. J. Combin."},{"key":"27_CR5","series-title":"Cambridge Mathematical Library","volume-title":"Algebraic Graph Theory","author":"N Biggs","year":"1993","unstructured":"Biggs, N.: Algebraic Graph Theory. Cambridge Mathematical Library. Cambridge University Press, Cambridge (1993)"},{"key":"27_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1112\/blms\/13.1.1","volume":"13","author":"PJ Cameron","year":"1981","unstructured":"Cameron, P.J.: Finite permutation groups and finite simple groups. Bull. Lond. Math. Soc. 13, 1\u201322 (1981)","journal-title":"Bull. Lond. Math. Soc."},{"key":"27_CR7","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF03187604","volume":"6","author":"P Delsarte","year":"1977","unstructured":"Delsarte, P., Goethals, J.M., Seidel, J.J.: Spherical codes and designs. Geom. Dedicata 6, 363\u2013388 (1977)","journal-title":"Geom. Dedicata"},{"key":"27_CR8","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s004930050059","volume":"19","author":"S Evdokimov","year":"1999","unstructured":"Evdokimov, S., Ponomarenko, I.: Isomorphism of coloured graphs with slowly increasing multiplicity of jordan blocks. Combinatorica 19, 321\u2013333 (1999)","journal-title":"Combinatorica"},{"key":"27_CR9","unstructured":"Furst, M., Hopcroft, J., Luks, E.: A subexponential algorithm for trivalent graph isomorphism. Technical Report 80\u2013426, Department of Computer Science, Cornell University, Ithaca, NY (1980)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72453-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T04:57:39Z","timestamp":1570510659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72453-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319724522","9783319724539"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72453-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}