La métrica de resistencia efectiva
From MaRDI portal
Publication:6168015
DOI10.47234/mm.7604zbMath1516.05126MaRDI QIDQ6168015
Publication date: 8 August 2023
Published in: Miscelánea Matemática de la Sociedad Matemática Mexicana (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Convex programming (90C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Hilbert space approach to effective resistance metric
- Random walks and the effective resistance of networks
- A novel measure of edge and vertex centrality for assessing robustness in complex networks
- The {1}-inverse of the Laplacian of subdivision-vertex and subdivision-edge coronae with applications
- Graph Clustering using Effective Resistance
- Minimizing Effective Resistance of a Graph
- Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs
This page was built for publication: La métrica de resistencia efectiva