3 papers
cs.DS2026
A Time Algorithm for Cograph Deletion Using Unavoidable Subgraphs in Large Prime Graphs
Manuel Lafond, Francis Sarrazin
We study the parameterized complexity of the Cograph Deletion problem, which asks whether one can delete at most edges from a graph to make it -free. This is a well-known…
cs.DS2024
Cluster Editing on Cographs and Related Classes
Manuel Lafond, Alitzel López Sánchez, Weidong Luo
In the Cluster Editing problem, sometimes known as (unweighted) Correlation Clustering, we must insert and delete a minimum number of edges to achieve a graph in which every connec…
cs.DM2024
The Path-Label Reconciliation (PLR) Dissimilarity Measure for Gene Trees
Alitzel López Sánchez, José Antonio Ramírez-Rafael, Alejandro Flores-Lamas +2
In this study, we investigate the problem of comparing gene trees reconciled with the same species tree using a novel semi-metric, called the Path-Label Reconciliation (PLR) dissim…