Complexity of Splits Reconstruction for Low-Degree Trees

Abstract : Given a vertex-weighted tree $T$, the split of an edge $x y$ in $T$ is $min \{s_x, s_y\}$ where $s_x$ (respectively, $s_y$) is the sum of all weights of vertices that are closer to $x$ than to $y$ (respectively, closer to $y$ than to $x$) in $T$. Given a set of weighted vertices $V$ and a multiset of splits $S$, we consider the problem of constructing a tree on $V$ whose splits correspond to $S$. The problem is known to be NP-complete, even when all vertices have unit weight and the maximum vertex degree of $T$ is required to be no more than $4$. We show that (i) the problem is strongly NP-complete when $T$ is required to be a path. For this variant we exhibit an algorithm that runs in polynomial time when the number of distinct vertex weights is constant. We also show that (ii) the problem is NP-complete when all vertices have unit weight and the maximum degree of $T$ is required to be no more than $3$, and (iii) it remains NP-complete when all vertices have unit weight and $T$ is required to be a caterpillar with unbounded hair length and maximum degree at most $3$. Finally, we shortly discuss the problem when the vertex weights are not given but can be freely chosen by an algorithm. The considered problem is related to building libraries of chemical compounds used for drug design and discovery. In these inverse problems, the goal is to generate chemical compounds having desired structural properties, as there is a strong correlation between structural properties, such as the Wiener index, which is closely connected to the considered problem, and biological activity.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00607170
Contributor : Mathieu Liedloff <>
Submitted on : Friday, July 8, 2011 - 7:28:47 AM
Last modification on : Wednesday, February 13, 2019 - 6:44:01 PM

Links full text

Identifiers

Collections

Citation

Serge Gaspers, Mathieu Liedloff, Maya Jakobine Stein, Karol Suchan. Complexity of Splits Reconstruction for Low-Degree Trees. WG'2011 : 37th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2011, Tepla, Czech Republic. pp.167-178, ⟨10.1007/978-3-642-25870-1_16⟩. ⟨hal-00607170⟩

Share

Metrics

Record views

143