{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T20:25:36Z","timestamp":1675715136130},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,8,1]],"date-time":"1995-08-01T00:00:00Z","timestamp":807235200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1995,8]]},"DOI":"10.1007\/bf01293665","type":"journal-article","created":{"date-parts":[[2005,3,24]],"date-time":"2005-03-24T22:06:22Z","timestamp":1111701982000},"page":"138-153","source":"Crossref","is-referenced-by-count":4,"title":["Isomorphic tree spanner problems"],"prefix":"10.1007","volume":"14","author":[{"given":"L.","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Corneil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"B. Awerbuch, A. Baratz, and D. Peleg. Efficient broadcast and light-weight spanners. Manuscript, 1992."},{"key":"CR2","unstructured":"L. Cai. Tree 2-spanners. CMPT TR 91-4, School of Computing Science, Simon Fraser University, 1991."},{"key":"CR3","unstructured":"L. Cai. Tree Spanners: Spanning Trees that Approximate Distances. Ph.D. thesis, University of Toronto, Toronto, 1992. Technical Report 260\/92, Department of Computer Science, University of Toronto, 1992."},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"L. Cai and D. G. Corneil. Tree spanners.SIAM J. Discrete Math., 1995, to appear.","DOI":"10.1137\/S0895480192237403"},{"key":"CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson.Computers and Intractability: A Guide to the Theory of NP-completeness Freeman, San Francisco, 1979."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"J. E. Hopcroft and R. M. Karp. An n5\/2 algorithm for maximum matchings in bipartite graphs.SIAM J. Comput., 2:225?231, 1973.","journal-title":"SIAM J. Comput."},{"key":"CR7","first-page":"273","volume":"10","author":"D. Matula","year":"1968","unstructured":"D. Matula. An algorithm for subtree identification.SIAM Rev., 10:273?274, 1968.","journal-title":"SIAM Rev."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0167-5060(08)70324-8","volume":"2","author":"D. Matula","year":"1978","unstructured":"D. Matula. Subtree isomorphism in O(n5\/2).Am. Discrete Math., 2:91?106, 1978.","journal-title":"Am. Discrete Math."},{"issue":"2","key":"CR9","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1145\/322307.322309","volume":"29","author":"C. H. Papadimitriou","year":"1982","unstructured":"C. H. Papadimitriou and M. Yannakakis. The complexity of restricted spanning tree problems.J. Assoc. Comput. Mach., 29(2):285?309, 1982.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"D. Peleg and J. D. Ullman. An optimal synchronizer for the hypercube.Proc. 6th ACM Symposium on Principles of Distributed Computing, 1987, pp. 77?85.","DOI":"10.1145\/41840.41847"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"D. Peleg and E. Upfal. A tradeoff between space and efficiency for routing tables.Proc. 20th Ann. ACM Symposium on the Theory of Computing, 1988, pp. 43?52.","DOI":"10.1145\/62212.62217"},{"issue":"4","key":"CR12","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1137\/0206053","volume":"6","author":"S. W. Reyner","year":"1977","unstructured":"S. W. Reyner. An analysis of a good algorithm for the subtree problem.SIAM J. Comput., 6(4):730?732, 1977.","journal-title":"SIAM J. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01293665.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01293665\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01293665","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T11:18:33Z","timestamp":1556795913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01293665"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,8]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,8]]}},"alternative-id":["BF01293665"],"URL":"https:\/\/doi.org\/10.1007\/bf01293665","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,8]]}}}