{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:15Z","timestamp":1725663615078},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540551218"},{"type":"electronic","value":"9783540467359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55121-2_14","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:47:36Z","timestamp":1330249656000},"page":"148-158","source":"Crossref","is-referenced-by-count":1,"title":["Optimal vertex ordering of a graph and its application to symmetry detection"],"prefix":"10.1007","author":[{"given":"X. Y.","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Bunke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,5]]},"reference":[{"key":"14_CR1","unstructured":"S. G. Akl, The design and analysis of parallel algorithms, Prentice Hall, 1989."},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"731","DOI":"10.4153\/CJM-1966-073-4","volume":"18","author":"D. W. Barnette","year":"1966","unstructured":"D. W. Barnette, Trees in polyhedral graphs, Canad. J. Math., 18, 731\u2013736, 1966.","journal-title":"Canad. J. Math."},{"issue":"4","key":"14_CR3","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1137\/0205051","volume":"5","author":"D. Cheriton","year":"1976","unstructured":"D. Cheriton, R. E. Tarjan, Finding minimum spanning-trees, SIAM J. on Comput., 5 (4), 724\u2013742, 1976.","journal-title":"SIAM J. on Comput."},{"issue":"5","key":"14_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. W. Dijkstra","year":"1959","unstructured":"E. W. Dijkstra, An note on two problems in connection with graphs, Numerische Mathematik, 1 (5), 269\u2013271, 1959.","journal-title":"Numerische Mathematik"},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1137\/0206011","volume":"6","author":"H. N. Gabow","year":"1977","unstructured":"H. N. Gabow, Two algorithms for generating weighted spanning trees in order, SIAM J. on Comput, 6, 139\u2013150, 1977.","journal-title":"SIAM J. on Comput"},{"key":"14_CR6","unstructured":"B. Gr\u00fcnbaum, Convex polytopes, Interscience Publishers, 1967."},{"key":"14_CR7","unstructured":"B. Gr\u00fcnbaum, Polytopal graphs, in D. R. Fulkerson (Ed.), Studies in graph theory, The Mathematical Association of America, 201\u2013224, 1975."},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1117\/12.962362","volume":"1153","author":"X. Y. Jiang","year":"1989","unstructured":"X. Y. Jiang, H. Bunke, Recognition of overlapping convex objects using interpretation tree search and EGI matching, Proc. of SPIE Conf. on Applications of Digital Image Processing XII, Vol. 1153, San Diego, 611\u2013620, 1989.","journal-title":"Proc. of SPIE Conf. on Applications of Digital Image Processing XII"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"X. Y. Jiang, H. Bunke, Determining symmetry of polyhedra, Proc. of Int. Workshop on Visual Form, Capri, Italy, 1991.","DOI":"10.1007\/978-1-4899-0715-8_30"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"X. Y. Jiang, H. Bunke, Detektion von Symmetrien polyedrischer Objekte, in R. E. Grosskopf (Ed.), Mustererkennung 1990, Proc. of 12th German Pattern Recognition Symposium (DAGM), Informatik Fachberichte 254, Springer-Verlag, 225\u2013231, 1990.","DOI":"10.1007\/978-3-642-84305-1_26"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"X. Y. Jiang, H. Bunke, Recognizing 3-D objects in needle maps, Proc. of 10th Int. Conf. on Pattern Recognition, Atlantic City, New Jersey, 237\u2013239, 1990.","DOI":"10.1109\/ICPR.1990.118102"},{"key":"14_CR12","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0020-0190(75)90001-0","volume":"4","author":"D. B. Johnson","year":"1975","unstructured":"D. B. Johnson, Priority queues with update and minimum spanning trees, Inf. Process. Lett, 4, 53\u201357, 1975.","journal-title":"Inf. Process. Lett"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"A. Kershenbaum, R. Van Slyke, Computing minimum spanning trees efficiently, Proc. Ass. Comput. Math. Conf., 517\u2013528, 1972.","DOI":"10.1145\/800193.569966"},{"key":"14_CR14","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1145\/361284.361299","volume":"15","author":"V. Kevin","year":"1972","unstructured":"V. Kevin, M. Whitney, Algorithm 422 \u2014 Minimal spanning tree, CACM, 15, 273\u2013274, 1972.","journal-title":"CACM"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"J. B. Kruskal Jr., On the shortest spanning sub-tree and the traveling salesman problem, Proceedings of Annual ACM Conference, 518\u2013527, 1956.","DOI":"10.2307\/2033241"},{"key":"14_CR16","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R. C. Prim","year":"1957","unstructured":"R. C. Prim, Shortest connection networks and some generalisations, Bell System Tech. J., 36, 1389\u20131401, 1957.","journal-title":"Bell System Tech. J."},{"issue":"3","key":"14_CR17","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1145\/2514.2515","volume":"16","author":"M. J. Quinn","year":"1984","unstructured":"M. J. Quinn, N. Deo, Parallel graph algorithms, Computing Surveys, 16 (3), 319\u2013348, 1984.","journal-title":"Computing Surveys"},{"key":"14_CR18","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0020-0190(75)90056-3","volume":"4","author":"A. C. Yao","year":"1975","unstructured":"A. C. Yao, An O(\u00a6E\u00a6log log \u00a6V\u00a6) algorithm for finding minimum spanning tree, Inf. Process. Lett., 4, 21\u201323, 1975.","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55121-2_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T14:20:51Z","timestamp":1713622851000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55121-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540551218","9783540467359"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-55121-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}