{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T11:40:12Z","timestamp":1737632412844,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540410041"},{"type":"electronic","value":"9783540452539"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","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":[[2000]]},"DOI":"10.1007\/3-540-45253-2_8","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T21:06:25Z","timestamp":1194987985000},"page":"76-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Recognizing Cayley Graphs"],"prefix":"10.1007","author":[{"given":"Lali","family":"Barri\u00e8re","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Fraigniaud","sequence":"additional","affiliation":[]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[]},{"given":"Bernard","family":"Mans","sequence":"additional","affiliation":[]},{"given":"John M.","family":"Robson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,11]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0021-9800(67)80037-1","volume":"2","author":"A.\u00c1d\u00e1m","year":"1967","unstructured":"A.\u00c1d\u00e1m. Research problem 2\u201310. J. Combin. Theory, 2:393, 1967.","journal-title":"J. Combin. Theory"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0012-365X(79)90011-6","volume":"25","author":"B. Alspach","year":"1979","unstructured":"B. Alspach and T. Parsons. Isomorphism of circulant graphs and digraphs. Discrete Mathematics, 25:97\u2013108, 1979.","journal-title":"Discrete Mathematics"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"L. Babai. Automorphism groups, isomorphism, reconstruction. In R. Graham, M. Gr\u00f6tschel, and L. Lov\u00e1sz, editors, Handbook of Combinatorics, vol. 2. Elsevier and MIT Press, 1995.","DOI":"10.1016\/B978-044488002-4\/50029-4"},{"key":"8_CR4","unstructured":"G. Birkhoff and S. MacLane. Algebra. Macmillan, 1967."},{"issue":"3","key":"8_CR5","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1137\/S0097539796310801","volume":"29","author":"P. Boldi","year":"2000","unstructured":"P. Boldi and S. Vigna. Complexity of deciding Sense of Direction. SIAM Journal on Computing, 29(3):779\u2013789, 2000.","journal-title":"SIAM Journal on Computing"},{"issue":"1\u20133","key":"8_CR6","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0024-3795(98)10126-X","volume":"285","author":"B. Codenotti","year":"1998","unstructured":"B. Codenotti, I. Gerace and S. Vigna. Hardness Results and Spectral Techniques for Combinatorial Problems on Circulant Graphs. Linear Algebra Appl., 285(1\u20133):123\u2013142, 1998.","journal-title":"Linear Algebra Appl"},{"key":"8_CR7","first-page":"229","volume":"9","author":"B. Elspas","year":"1970","unstructured":"B. Elspas and J. Turner. Graphs with circulant adjacency matrices. J. Comb. Theory, 9:229\u2013240, 1970.","journal-title":"J. Comb. Theory"},{"key":"8_CR8","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proceedings of DISC\u2019 98","author":"P. Flocchini","year":"1998","unstructured":"P. Flocchini, B. Mans, and N. Santoro. Sense of direction in distributed computing. In Proceedings of DISC\u2019 98, LNCS vol. 1499, Springer-Verlag, S. Kutten (Ed.), pages 1\u201315, 1998."},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0166-218X(98)00051-1","volume":"87","author":"P. Flocchini","year":"1998","unstructured":"P. Flocchini, A. Roncato, and N. Santoro. Symmetries and sense of direction in labeled graphs. Discrete Applied Mathematics, 87:99\u2013115, 1998.","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/BFb0028575","volume-title":"Proceedings of STACS\u2019 98","author":"T. Hagerup","year":"1998","unstructured":"T. Hagerup. Sorting and searching on the word RAM. In Proceedings of STACS\u2019 98, LNCS vol. 1379, Springer-Verlag, M. Morvan and Meinel (Eds.), pp. 366\u2013398, 1998."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"T. Leighton Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.","DOI":"10.1016\/B978-1-4832-0772-8.50005-4"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1002\/(SICI)1097-0118(199801)27:1<21::AID-JGT5>3.0.CO;2-I","volume":"27","author":"L. Praeger","year":"1998","unstructured":"Li, Praeger, and M. Xu. On finite groups with the Cayley isomorphism property. Journal of Graph Theory, 27:21\u201331, 1998.","journal-title":"Journal of Graph Theory"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"G. Miller. On the nlog n isomorphism technique. In Proceedings Tenth Annual ACM Symposium on Theory of Computing (STOC), pp. 51\u201358, 1978.","DOI":"10.1145\/800133.804331"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1002\/(SICI)1097-0118(199908)31:4<345::AID-JGT9>3.0.CO;2-V","volume":"31","author":"J. Morris","year":"1999","unstructured":"J. Morris. Isomorphic Cayley graphs on nonisomorphic groups. Journal of Graph Theory, 31:345\u2013362, 1999.","journal-title":"Journal of Graph Theory"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"M. Muzychuk and G. Tinhoffer. Recognizing circulant graphs of prime order in polynomial time. The electronic journal of combinatorics, 3, 1998.","DOI":"10.37236\/1363"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jcss.1996.0045","volume":"53","author":"N. Vikas","year":"1996","unstructured":"N. Vikas. An O(n) algorithm for Abelian p-group isomorphism and an O(n log n) algorithm for Abelian group isomorphism. Journal of Computer and System Sciences, 53:1\u20139, 1996.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2000"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45253-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T08:23:54Z","timestamp":1737534234000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45253-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410041","9783540452539"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45253-2_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"11 February 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}