{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:14:11Z","timestamp":1725455651978},"publisher-location":"Berlin\/Heidelberg","reference-count":6,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540139125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0024009","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T05:44:22Z","timestamp":1132379062000},"page":"197-207","source":"Crossref","is-referenced-by-count":0,"title":["An O(N1.5+\u03b5) expected time algorithm for canonization and isomorphism testing of trivalent graphs"],"prefix":"10.1007","author":[{"given":"Lud\u011bk","family":"Ku\u010dera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"L.Babai, W.M.Kantor, E.M.Luks, Computational complexity and the classification of finite simple semigroups, 24th Annual Symposium on Foundations of Computer Science, 1983, 162\u2013171","DOI":"10.1109\/SFCS.1983.10"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"L.Babai, L.Ku\u010dera, Canonical labelling of graphs in linear average time, 20th Annual Symposium on Foundations of Computer Science, 1979, 39\u201346.","DOI":"10.1109\/SFCS.1979.8"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"L.Babai, E.M.Luks, Canonical labeling of graphs, 15th Annual Symposium on Theory of Computation,,1983, 171\u2013183.","DOI":"10.1145\/800061.808746"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"M.F\u00fcrer, W.Schnyder, E.Specker, Normal forms for trivalent graphs and graphs of bounded valence, 15th Annual Symposium on Theory of Computation, 1983,171\u2013183.","DOI":"10.1145\/800061.808745"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Z.Galil, C.M.Hoffman, E.M.Luks, C.P.Schnorr,A.Weber, An O(n3log n) deterministic and O(n3) probabilistic isomorphism test for trivalent graphs, 23rd Annual Symposium on Foundation of Computer Science, 1982, 118\u2013125.","DOI":"10.1109\/SFCS.1982.62"},{"key":"21_CR6","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"E.M. Luks","year":"1982","unstructured":"E.M. Luks, Isomorphism of graphs of bounded valence can be tested in polynomial time, Journal of Computer and System Sciences 25 1982, 42\u201365.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","STACS 85"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024009.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:51:27Z","timestamp":1607550687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024009"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540139125"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/bfb0024009","relation":{},"subject":[]}}