Improved methods for computing distances between unordered trees using integer programming

DOI10.1007/978-3-319-71147-8_4zbMath1474.90294arXiv1706.03473OpenAlexW2624871005MaRDI QIDQ1708596

Eunpyeong Hong, Yasuaki Kobayashi, Akihiro Yamamoto

Publication date: 26 March 2018

Full work available at URL: https://arxiv.org/abs/1706.03473

zbMATH Keywords

integer programmingdynamic programmingtree edit distanceunorderd trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

This page was built for publication: Improved methods for computing distances between unordered trees using integer programming