Finding the root graph through minimum edge deletion - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2021

Finding the root graph through minimum edge deletion

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

Citer

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⟩
53 Consultations
94 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More