Correcting a graph into a linegraph minimizing hamming distance edition is NP-complete and FPT by treewidth
Dominique Barth, Dimitri Watel, Marc-Antoine Weisser. Correcting a graph into a linegraph minimizing hamming distance edition is NP-complete and FPT by treewidth. Journal of Graph Algorithms and Applications, 2025, 29 (1), pp.63-90. ⟨10.7155/jgaa.v29i1.3029⟩. ⟨hal-05051712⟩
