|
MATHEMATICS
An exact quadratic algorithm for the shortest tree transformation
K. Yu. Gorbunova, V. A. Lyubetskiiab a Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute), Moscow, Russia
b Lomonosov Moscow State University, Moscow, Russia
Abstract:
The article proposes a new exact quadratic algorithm in complexity that solves the problem of the shortest transformation (“alignment”) of one loaded tree into another, taking into account arbitrary prices of operations on trees. Three operations are considered: adding vertex deletions to an edge or root of a tree and shifting a subtree with deletions.
Keywords:
discrete optimization, shortest tree transformation, operations on a tree, operation price, exact algorithm, quadratic complexity algorithm, tree alignment.
Citation:
K. Yu. Gorbunov, V. A. Lyubetskii, “An exact quadratic algorithm for the shortest tree transformation”, Dokl. RAN. Math. Inf. Proc. Upr., 519 (2024), 22–27; Dokl. Math., 110:2 (2024), 373–378
Linking options:
https://www.mathnet.ru/eng/danma560 https://www.mathnet.ru/eng/danma/v519/p22
|
Statistics & downloads: |
Abstract page: | 34 |
|