Finding the root graph through minimum edge deletion

DOI10.1016/j.ejor.2020.07.001zbMath1487.05224OpenAlexW3041925499MaRDI QIDQ2028798

Alfredo Marín, Mercedes Pelegrín, Martine Labbé

Publication date: 3 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/311455/3/last-revision.pdf

zbMATH Keywords

discrete optimizationline graphshaplotyping

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Graph theory (including graph drawing) in computer science (68R10) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

New variants of the simple plant location problem and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Clustering in random line graphs
• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• On the asymmetric representatives formulation for the vertex coloring problem
• An efficient reconstruction of a graph from its line graph in parallel
• An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
• Node-and edge-deletion NP-complete problems
• The interchange graph of a finite graph
• Characterizations of derived graphs

This page was built for publication: Finding the root graph through minimum edge deletion