Finding the root graph through minimum edge deletion - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles European Journal of Operational Research Year : 2021

Finding the root graph through minimum edge deletion


The line graph of a graph G has one node per each edge of G, two of them being adjacent only when the corresponding edges have a node of G in common. In this work, we consider the problem of finding the minimum number of edges to delete so that the resulting graph is a line graph, which presents an interesting application in haplotyping of diploid organisms. We propose an Integer Linear Programming formulation for this problem. We compare our approach with the only other existing formulation for the problem and explore the possibility of combining both of them. Finally, we present a computational study to compare the different approaches proposed.
Fichier principal
Vignette du fichier
last-revision.pdf (589.92 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03001376 , version 1 (12-11-2020)



Martine Labbé, Alfredo Marín, Mercedes Pelegrín. Finding the root graph through minimum edge deletion. European Journal of Operational Research, 2021, ⟨10.1016/j.ejor.2020.07.001⟩. ⟨hal-03001376⟩
45 View
86 Download



Gmail Facebook Twitter LinkedIn More