{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:35:30Z","timestamp":1726407330138},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664123"},{"type":"electronic","value":"9783540483212"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48321-7_16","type":"book-chapter","created":{"date-parts":[[2007,11,5]],"date-time":"2007-11-05T12:57:55Z","timestamp":1194267475000},"page":"204-214","source":"Crossref","is-referenced-by-count":0,"title":["Graph automorphisms with maximal projection distances"],"prefix":"10.1007","author":[{"given":"H. N.","family":"de Ridder","sequence":"first","affiliation":[]},{"given":"H. L.","family":"Bodlaender","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,3]]},"reference":[{"key":"16_CR1","unstructured":"Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974."},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/BF01192049","volume":"14","author":"M.J. Atallah","year":"1995","unstructured":"M.J. Atallah, D.Z. Chen, and D.T. Lee. An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications. Algorithmica, 14:429\u2013441, 1995.","journal-title":"Algorithmica"},{"key":"16_CR3","unstructured":"L\u00e1szl\u00f3 Babai. Automorphism groups, isomorphism, reconstruction. In R. Graham, M. Gr\u00f6tschel, and L. Lov\u00e1sz, editors, Handbook of Combinatorics, chapter 27, pages 1447\u20131540. Elsevier Science, 1995."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Fred Buckley. Self-centered graphs. In Graph Theory and its Applications: East and West: Proceedings of the First China-USA International Graph Theory Conference, volume 576 of Annals of the New York Academy of Sciences, pages 71\u201378, 1989.","DOI":"10.1111\/j.1749-6632.1989.tb16384.x"},{"key":"16_CR5","unstructured":"Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. The MIT Press, 1990."},{"issue":"1","key":"16_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D.G. Corneil","year":"1981","unstructured":"D.G. Corneil, H. Lerchs, and L. Stewart Burlingham. Complement reducible graphs. Discrete Appl. Math., 3(1):163\u2013174, 1981.","journal-title":"Discrete Appl. Math."},{"key":"16_CR7","first-page":"249","volume":"43","author":"D.G. Corneil","year":"1984","unstructured":"D.G. Corneil, Y. Perl, and L. Stewart. Cographs: Recognition, applications and algorithms. Congressus Numerantium, 43:249\u2013258, 1984.","journal-title":"Congressus Numerantium"},{"issue":"4","key":"16_CR8","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D.G. Corneil","year":"1985","unstructured":"D.G. Corneil, Y. Perl, and L. K. Stewart. A linear recognition algorithm for cographs. SIAM J. Comput., 14(4):926\u2013934, November 1985.","journal-title":"SIAM J. Comput."},{"key":"16_CR9","unstructured":"E.M. Eschen and J.P. Spinrad. An O(n 2) algorithm for circular-arc graph recognition. In Proc. of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 128\u2013137, 1993."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Martin Charles Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, 1980.","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/S0097539793260726","volume":"24","author":"W.-L. Hsu","year":"1995","unstructured":"Wen-Lian Hsu. O(M\u00b7N) algorithms for the recognition and isomorphism problems on circular-arc graphs. SIAM J. Comput., 24(3):411\u2013439, June 1995.","journal-title":"SIAM J. Comput."},{"issue":"1","key":"16_CR12","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1137\/0210002","volume":"10","author":"A. Lubiw","year":"1981","unstructured":"Anna Lubiw. Some NP-complete problems similar to graph isomorphism. SIAM J. Comput., 10(1):11\u201321, February 1981.","journal-title":"SIAM J. Comput."},{"key":"16_CR13","unstructured":"Victor Neumann-Lara. On clique-divergent graphs. In Probl\u00e8mes Combinatoires et Th\u00e8orie des Graphes, number 260 in Colloques Internationaux C.N.R.S., pages 313\u2013315, 1978."},{"key":"16_CR14","unstructured":"Erich Prisner. Graph Dynamics. Number 338 in Pitman Research Notes in Mathematics. Longman, 1995."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48321-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T05:22:11Z","timestamp":1556947331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48321-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664123","9783540483212"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-48321-7_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}