Covering tree with stars

DOI10.1007/s10878-013-9692-yzbMath1328.90119DBLPjournals/jco/BaumbachGI15OpenAlexW2038180609WikidataQ62780002 ScholiaQ62780002MaRDI QIDQ2354301

Jan Baumbach, Jiong Guo, Rashid Ibragimov

Publication date: 10 July 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-013-9692-y

zbMATH Keywords

dynamic programmingNP-completenessgraph algorithmstree edit distance

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Uses Software

• TED
• RTED

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey on tree edit distance and related problems
• Exact algorithms for computing the tree edit distance between unordered trees
• A survey of graph edit distance
• On the editing distance between unordered labeled trees
• Some MAX SNP-hard results concerning unordered labeled trees
• On the completeness of a generalized matching problem
• An Optimal Decomposition Algorithm for Tree Edit Distance
• Complexity classification of some edge modification problems

This page was built for publication: Covering tree with stars