{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T00:29:23Z","timestamp":1768782563629,"version":"3.49.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T00:00:00Z","timestamp":1386806400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10878-013-9692-y","type":"journal-article","created":{"date-parts":[[2013,12,10]],"date-time":"2013-12-10T22:55:54Z","timestamp":1386716154000},"page":"141-152","source":"Crossref","is-referenced-by-count":2,"title":["Covering tree with stars"],"prefix":"10.1007","volume":"29","author":[{"given":"Jan","family":"Baumbach","sequence":"first","affiliation":[]},{"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Rashid","family":"Ibragimov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,12,12]]},"reference":[{"key":"9692_CR1","volume-title":"The design and analysis of computer algorithms","author":"AV Aho","year":"1974","unstructured":"Aho AV, Hopcroft JE, Ullman JD (1974) The design and analysis of computer algorithms. Addison-Wesley, Reading"},{"key":"9692_CR2","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1587\/transinf.E93.D.208","volume":"93","author":"T Akutsu","year":"2010","unstructured":"Akutsu T (2010) Tree edit distance problems: algorithms and applications to bioinformatics. IEICE Trans Inf Syst 93:208\u2013218","journal-title":"IEICE Trans Inf Syst"},{"issue":"4\u20135","key":"9692_CR3","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1016\/j.tcs.2010.10.002","volume":"412","author":"T Akutsu","year":"2011","unstructured":"Akutsu T, Fukagawa D, Takasu A, Tamura T (2011) Exact algorithms for computing the tree edit distance between unordered trees. Theor Comput Sci 412(4\u20135):352\u2013364","journal-title":"Theor Comput Sci"},{"issue":"1\u20133","key":"9692_CR4","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.tcs.2004.12.030","volume":"337","author":"P Bille","year":"2005","unstructured":"Bille P (2005) A survey on tree edit distance and related problems. Theor Comput Sci 337(1\u20133):217\u2013239","journal-title":"Theor Comput Sci"},{"issue":"4","key":"9692_CR5","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1109\/TCBB.2010.53","volume":"7","author":"G Blin","year":"2010","unstructured":"Blin G, Sikora F, Vialette S (2010) Querying graphs in protein\u2013protein interactions networks using feedback vertex set. IEEE\/ACM Trans Comput Biol Bioinform 7(4):628\u2013635","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"9692_CR6","doi-asserted-by":"crossref","DOI":"10.1002\/9783527627981.ch6","volume-title":"Graph edit distance\u2014optimal and suboptimal algorithms with applications","author":"H Bunke","year":"2009","unstructured":"Bunke H, Riesen K (2009) Graph edit distance\u2014optimal and suboptimal algorithms with applications. Wiley-VCH Verlag GmbH and Co. KGaA, Weinheim"},{"issue":"3","key":"9692_CR7","first-page":"265","volume":"18","author":"D Conte","year":"2004","unstructured":"Conte D, Foggia P, Sansone C, Vento M (2004) Thirty years of graph matching in pattern recognition. IJPRAI 18(3):265\u2013298","journal-title":"IJPRAI"},{"key":"9692_CR8","doi-asserted-by":"crossref","unstructured":"Demaine E, Mozes S, Rossman B, Weimann O (2007) An optimal decomposition algorithm for tree edit distance. In: Automata, , languages and programming. Lecture notes in computer science, vol 4596. Springer, Berlin, pp 146\u2013157","DOI":"10.1007\/978-3-540-73420-8_15"},{"issue":"1","key":"9692_CR9","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","volume":"13","author":"X Gao","year":"2010","unstructured":"Gao X, Xiao B, Tao D, Li X (2010) A survey of graph edit distance. Pattern Anal Appl 13(1):113\u2013129","journal-title":"Pattern Anal Appl"},{"key":"9692_CR10","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco"},{"key":"9692_CR11","unstructured":"Kirkpatrick DG, Hell P (1978) On the completeness of a generalized matching problem. In: Proceedings of the tenth annual ACM symposium on theory of computing, STOC\u201978. ACM, New York, pp 240\u2013245"},{"issue":"1","key":"9692_CR12","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0166-218X(00)00391-7","volume":"113","author":"A Natanzon","year":"2001","unstructured":"Natanzon A, Shamir R, Sharan R (2001) Complexity classification of some edge modification problems. Discret Appl Math 113(1):109\u2013128","journal-title":"Discret Appl Math"},{"issue":"4","key":"9692_CR13","first-page":"334","volume":"5","author":"M Pawlik","year":"2011","unstructured":"Pawlik M, Augsten N (2011) RTED: a robust algorithm for the tree edit distance. PVLDB 5(4):334\u2013345","journal-title":"PVLDB"},{"key":"9692_CR14","unstructured":"Sharan R (2002) Graph modification problems and their applications to genomic research. PhD Thesis, Tel-Aviv University"},{"issue":"5","key":"9692_CR15","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0020-0190(94)90062-0","volume":"49","author":"K Zhang","year":"1994","unstructured":"Zhang K, Jiang T (1994) Some MAX SNP-hard results concerning unordered labeled trees. Inf Process Lett 49(5):249\u2013254","journal-title":"Inf Process Lett"},{"issue":"3","key":"9692_CR16","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(92)90136-J","volume":"42","author":"K Zhang","year":"1992","unstructured":"Zhang K, Statman R, Shasha D (1992) On the editing distance between unordered labeled trees. Inf Process Lett 42(3):133\u2013139","journal-title":"Inf Process Lett"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9692-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9692-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9692-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T15:31:19Z","timestamp":1564932679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9692-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,12]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9692"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9692-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,12]]}}}