Minimizing Effective Resistance of a Graph
By Arpita Ghosh, Stephen P. Boyd, Amin Saberi. SIAM Review, 2008
542 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Geometry and Topology, Materials Chemistry
View Paper: https://www.semanticscholar.org/paper/97165d269946271ece688e4a868228160cb8347d
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Florian Dörfler
- Francesco Bullo
- Ernesto Estrada
- M. Jovanovi'c
- Junzhou Huang
- Jorge Cortés
- Jürgen Kurths
- Reza Olfati-Saber
In Geometry and Topology
In Materials Chemistry
- Francesco Bullo
- Florian Dörfler
- Ernesto Estrada
- Junzhou Huang
- Yu Rong
- Ivan Gutman
- Jef Beerten
- Ronnie J. M. Belmans
Citations in the corpus
- Design of Optimal Sparse Feedback Gains via the Alternating Direction Method of Multipliers (2011, background): “The detailed derivation is omitted for brevity; see [57] for related results.”
- DropEdge: Towards Deep Graph Convolutional Networks on Node Classification (2019, background): “, 2008); (2) predicting which community different posts belong to in the Reddit social network (Hamilton et al., 2017). Note that the tasks in Cora, Citeseer and Pubmed are transductive underlying all node features are accessible during training, while the task in Reddit is inductive meaning the tes”
- Kron Reduction of Graphs With Applications to Electrical Networks (2011, background): “We refer the reader to [35, 20, 27, 31, 28, 26, 6] for various applications and properties of the effective resistance as well as interesting results relating R, L, Q, L†, and Q−1.”
- A Distributed Control Strategy for Reactive Power Compensation in Smart Microgrids (2011, unknown): “The matrix depends only on the topology of the microgrid power lines and on their impedance (compare it with the definition of Green matrix in [28]).”
- The communicability distance in graphs (2012, background): “Another graph distance is the so-called resistance or commute distance [7–9].”