Finding the root graph through minimum edge deletion
DOI10.1016/J.EJOR.2020.07.001zbMATH Open1487.05224OpenAlexW3041925499MaRDI QIDQ2028798FDOQ2028798
Authors: Martine Labbé, Alfredo Marín, Mercedes Pelegrín
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
Recommendations
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Integer programming (90C10) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Characterizations of derived graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Node-and edge-deletion NP-complete problems
- On the asymmetric representatives formulation for the vertex coloring problem
- The interchange graph of a finite graph
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- An efficient reconstruction of a graph from its line graph in parallel
- Clustering in random line graphs
Cited In (3)
This page was built for publication: Finding the root graph through minimum edge deletion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2028798)