Login / Signup

Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network.

Wilfried Joseph EhounouDominique BarthArnaud De MoissacDimitri WatelMarc-Antoine Weisser
Published in: J. Graph Algorithms Appl. (2020)
Keyphrases
  • hamming distance
  • small world
  • weighted graph
  • spanning tree
  • graph structure
  • fully connected
  • data sets
  • wireless sensor networks
  • distance measure
  • directed graph
  • graph model
  • pairwise
  • euclidean distance
  • complex networks