Semi‐labeled unrooted binary tree optimization subject to nonnegativity
Sign Up to like & getrecommendations! Published in 2022 at "Networks"
DOI: 10.1002/net.22090
Abstract: Let Dn×n denote the distance matrix of n objects, and let T be an unrooted binary tree in which the leaves denote those n objects. We want to find such a tree with the constraint… read more here.
Keywords: unrooted binary; labeled unrooted; semi labeled; binary tree ... See more keywords