{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:32:15Z","timestamp":1725795135534},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319080154"},{"type":"electronic","value":"9783319080161"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08016-1_27","type":"book-chapter","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T00:18:07Z","timestamp":1401409087000},"page":"298-308","source":"Crossref","is-referenced-by-count":1,"title":["On Star-Cover and Path-Cover of a Tree"],"prefix":"10.1007","author":[{"given":"Jie","family":"You","sequence":"first","affiliation":[]},{"given":"Qilong","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Feng","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"27_CR1","doi-asserted-by":"publisher","first-page":"1656","DOI":"10.1137\/S0097539794269461","volume":"26","author":"A. Amir","year":"1997","unstructured":"Amir, A., Keselman, D.: Maximum agreement subtree in a set of evolutionary trees: metrics and efficient algorithms. SIAM J.\u00a0Comput.\u00a026(6), 1656\u20131669 (1997)","journal-title":"SIAM J.\u00a0Comput."},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/0263-7855(84)80060-0","volume":"2","author":"S. Anderson","year":"1984","unstructured":"Anderson, S.: Graphical representation of molecules and substructure-search queries in MACCS. Journal of Molecular Graphics\u00a02, 8\u201390 (1984)","journal-title":"Journal of Molecular Graphics"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-642-38768-5_34","volume-title":"Computing and Combinatorics","author":"J. Baumbach","year":"2013","unstructured":"Baumbach, J., Guo, J., Ibragimov, R.: Covering Tree with Stars. In: Du, D.-Z., Zhang, G. (eds.) COCOON 2013. LNCS, vol.\u00a07936, pp. 373\u2013384. Springer, Heidelberg (2013)"},{"key":"27_CR4","first-page":"217","volume":"337","author":"P. Bille","year":"2005","unstructured":"Bille, P.: A survey on tree edit distance and reltaed problems. Theoret.\u00a0Comput.\u00a0Sci.\u00a0337, 217\u2013239 (2005)","journal-title":"Theoret.\u00a0Comput.\u00a0Sci."},{"issue":"2","key":"27_CR5","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jagm.2001.1186","volume":"41","author":"J. Chen","year":"2001","unstructured":"Chen, J., Kanj, I., Jia, W.: Vertex cover: further observations and further improvements. J. Algorithms\u00a041(2), 280\u2013301 (2001)","journal-title":"J. Algorithms"},{"issue":"12","key":"27_CR6","first-page":"1","volume":"5","author":"X. Chen","year":"2008","unstructured":"Chen, X., Liu, L., Liu, Z.: On the minimum common integer partition problem. ACM Trans. Algorithm\u00a05(12), 1\u201318 (2008)","journal-title":"ACM Trans. Algorithm"},{"issue":"3","key":"27_CR7","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D. Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. International Journal of Pattern Recognition\u00a018(3), 265\u2013298 (2004)","journal-title":"International Journal of Pattern Recognition"},{"key":"27_CR8","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms. McGraw-Hill, Boston (2001)"},{"key":"27_CR9","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Wong, J.K.: Linear time algorithm for isomorphism of planar graphs. In: Proc. 6th Annual ACM Symp.\u00a0Theory of Computing (STOC 1974), pp. 172\u2013184 (1974)","DOI":"10.1145\/800119.803896"},{"issue":"9","key":"27_CR11","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1089\/cmb.2011.0254","volume":"19","author":"B. Kirkpatrick","year":"2012","unstructured":"Kirkpatrick, B., Reshef, Y., Finucane, H., Jiang, H., Zhu, B., Karp, R.: Comparing pedigree graphs. Journal of Computational Biology\u00a019(9), 998\u20131014 (2012)","journal-title":"Journal of Computational Biology"},{"key":"27_CR12","unstructured":"Klein, P., Tirthapura, S., Sharvit, D., Kimia, B.: A tree-edit-distance algorithm for comparing simple, closed shapes. In: Proc. 11th Annual ACM-SIAM Symp.\u00a0Discrete Algorithms (SODA 2000), pp. 696\u2013704 (2000)"},{"issue":"11","key":"27_CR13","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1109\/34.809105","volume":"21","author":"M. Pelillo","year":"1999","unstructured":"Pelillo, M., Siddiqi, K., Zucker, S.W.: Matching hierarchical structures using association graphs. IEEE Trans.\u00a0Pattern Analysis and Machine Intelligence\u00a021(11), 1105\u20131119 (1999)","journal-title":"IEEE Trans.\u00a0Pattern Analysis and Machine Intelligence"},{"key":"27_CR14","unstructured":"Shi, F., Wang, J., Chen, J., Feng, Q., Guo, J.: Algorithms for parameterized maximum agreement forest problem on multiple trees. Theoret.\u00a0Comput.\u00a0Sci. (in press)"},{"key":"27_CR15","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1021\/ci00047a025","volume":"25","author":"R.E. Stobaugh","year":"1985","unstructured":"Stobaugh, R.E.: Chemical substructure searching. Journal of Chemical Information and Computer Sciences\u00a025, 271\u2013275 (1985)","journal-title":"Journal of Chemical Information and Computer Sciences"},{"issue":"4","key":"27_CR16","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/s00778-004-0134-4","volume":"13","author":"H. Yang","year":"2004","unstructured":"Yang, H., Lee, L., Hsu, W.: Finding hot query patterns over an XQuery stream. The International Journal of Very large Data Bases\u00a013(4), 318\u2013332 (2004)","journal-title":"The International Journal of Very large Data Bases"},{"issue":"1","key":"27_CR17","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cosrev.2007.07.002","volume":"1","author":"R. Yuster","year":"2007","unstructured":"Yuster, R.: Combinatorial and computational aspects of graph packing and graph decomposition. Computer Science Review\u00a01(1), 12\u201326 (2007)","journal-title":"Computer Science Review"},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J.\u00a0Comput.\u00a018, 1245\u20131262 (1989)","journal-title":"SIAM J.\u00a0Comput."}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08016-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T01:01:33Z","timestamp":1649120493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08016-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319080154","9783319080161"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08016-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}