Article dans une revue, GALaC, Complexité, Computational Complexity, Computer Science
Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network
Wilfried Ehounou, Dominique Barth, Arnaud de Moissac, Dimitri Watel, Marc-Antoine Weisser. Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network. Journal of Graph Algorithms and Applications, 2020, 24 (3), pp.133-153. ⟨10.7155/jgaa.00522⟩. ⟨hal-04113890⟩