Article dans une revue, Computer Science, Informatique
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⟩
