Algorithmic techniques for finding resistance distances on structured graphs (Q2166256)

In this paper, the authors give a survey of methods used to calculate values of resistance distance (also known as effective resistance) in graphs. Resistance distance has played a prominent role not only in circuit theory and chemistry but also in combinatorial matrix theory and spectral graph theory. Moreover, resistance distance has applications ranging from quantifying biological structures, distributed control systems, network analysis, and power grid systems. In this paper, the authors discuss various exact techniques and approximate techniques for computing the resistance distance in an arbitrary graph as well as on different special classes of graphs. For each method, they provide an illustrative example. Finally, they present some open questions and conjectures. The paper is interested in various graph theory applications.