Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network
DOI10.7155/JGAA.00522zbMATH Open1447.05069OpenAlexW3010783666MaRDI QIDQ5119373FDOQ5119373
Authors: Wilfried Ehounou, Arnaud de Moissac, Dimitri Watel, Marc-Antoine Weisser, D. Barth 
Publication date: 4 September 2020
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00522
Recommendations
- Some inverse optimization problems under the Hamming distance
- Improvement of shortest path of arborescent network in the case of Hamming distance
- Electrical flows over spanning trees
- Methods to search for configurations of distribution networks
- Network design for minimum spanning trees under Hamming distance
Applications of graph theory (05C90) Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12)
Cites Work
- ILIGRA: an efficient inverse line graph algorithm
- Title not available (Why is that?)
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Node-and edge-deletion NP-complete problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Listing all maximal cliques in sparse graphs in near-optimal time
- An efficient reconstruction of a graph from its line graph in parallel
Uses Software
This page was built for publication: Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5119373)
