Multistage difference-of-convex programming reconstructs topology and edge resistances of circular planar resistive networks from limited measurements assuming known node counts and Kirchhoff index.
Goldstein, An efficient and constructive algorithm for test- ing whether a graph can be embedded in a plane, in: Graph and Combinatorics Conference, Contract No
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Topology Reconstruction of a Resistor Network with Limited Boundary Measurements: An Optimization Approach
Multistage difference-of-convex programming reconstructs topology and edge resistances of circular planar resistive networks from limited measurements assuming known node counts and Kirchhoff index.