Skip to Main content Skip to Navigation
Journal articles

Finding the root graph through minimum edge deletion

Martine Labbé 1, 2 Alfredo Marín 3 Mercedes Pelegrín 3, 4
1 INOCS - Integrated Optimization with Complex Structure
Inria Lille - Nord Europe, ULB - Université libre de Bruxelles, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-03001376
Contributor : Martine Labbé <>
Submitted on : Thursday, November 12, 2020 - 12:56:39 PM
Last modification on : Friday, November 27, 2020 - 2:20:11 PM

File

last-revision.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03001376, version 1

Collections

Citation

Martine Labbé, Alfredo Marín, Mercedes Pelegrín. Finding the root graph through minimum edge deletion. European Journal of Operational Research, Elsevier, In press. ⟨hal-03001376⟩

Share

Metrics

Record views

25

Files downloads

79