Geodesic
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, Tome 24 (2020) no. 3, pp. 133-153.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

Our objective is to discover the topology of an energy distribution network modeled by a flow digraph from which we know the set of arcs without identification of their extremities. We also know possible correlations between these arcs from measurements in which errors could occur. To discover the network’s topology from the obtained correlation matrix between arcs, we consider the graph whose incidence matrix is the correlation matrix with entries rounded to zero or one. Without errors in the correlations, this graph is the line-graph of the distribution network. We propose an algorithm that given the rounded correlation matrix M, finds the incidence matrix of a line-graph with minimum Hamming distance to M. We then evaluate the performance of this approach by simulation.
DOI : 10.7155/jgaa.00522
Keywords: Line-graph, Electrical Networks, NP-Completeness, Heuristic 
@article{JGAA_2020_24_3_a0,
     author = {Wilfried Ehounou and Dominique Barth and Arnaud de Moissac and Dimitri Watel and Marc-Antoine Weisser},
     title = {Minimizing the {Hamming} distance between a graph and a line-graph to discover the topology of an electrical network},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {133--153},
     publisher = {mathdoc},
     volume = {24},
     number = {3},
     year = {2020},
     doi = {10.7155/jgaa.00522},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00522/}
}
TY  - JOUR
AU  - Wilfried Ehounou
AU  - Dominique Barth
AU  - Arnaud de Moissac
AU  - Dimitri Watel
AU  - Marc-Antoine Weisser
TI  - Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network
JO  - Journal of Graph Algorithms and Applications
PY  - 2020
SP  - 133
EP  - 153
VL  - 24
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00522/
DO  - 10.7155/jgaa.00522
LA  - en
ID  - JGAA_2020_24_3_a0
ER  - 
%0 Journal Article
%A Wilfried Ehounou
%A Dominique Barth
%A Arnaud de Moissac
%A Dimitri Watel
%A Marc-Antoine Weisser
%T Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network
%J Journal of Graph Algorithms and Applications
%D 2020
%P 133-153
%V 24
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00522/
%R 10.7155/jgaa.00522
%G en
%F JGAA_2020_24_3_a0
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, Tome 24 (2020) no. 3, pp. 133-153. doi : 10.7155/jgaa.00522. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00522/

Cité par Sources :