Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network (Q5119373): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.7155/jgaa.00522 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3010783666 / rank | |||
Normal rank | |||
Revision as of 02:44, 20 March 2024
scientific article; zbMATH DE number 7243655
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network |
scientific article; zbMATH DE number 7243655 |
Statements
Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network (English)
0 references
4 September 2020
0 references
line-graph
0 references
electrical networks
0 references
NP-completeness
0 references
heuristic
0 references
