Open access
Aug 2026
Hardness of Linear Variants of the Balanced Minimum Evolution Problem
A cubic tree is a tree with leaves in which every internal vertex has degree exactly 3. Any such tree can be encoded by a Path‐Length Matrix (PLM), that is, an integer matrix whose th entry gives the number of edges in the unique path between leaves and in . The convex hull of all PLMs associated with cubic tre...
D. Catanzaro, G. Joret, Brieuc Pierre et al.
· Networks · 0 citations