Hardness of \textsc{Balanced Mobiles}

DOI10.1007/978-3-031-34347-6_3MaRDI QIDQ6182887zbMATH OpenOpenAlexFDO

Authors Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora

Publication date 22 December 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-34347-6_3

zbMATH Keywords

\textsc{Balanced Mobiles}colless indexphylogenetic treesstrong \textsf{NP}-hardness

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• A Method for the Construction of Minimum-Redundancy Codes
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Introduction to algorithms.
• On the minimum value of the Colless index and the bifurcating trees that achieve it
• Squaring within the Colless index yields a better balance index
• The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balance

This page was built for publication: Hardness of \textsc{Balanced Mobiles}

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6182887)