Algorithmic techniques for finding resistance distances on structured graphs
نویسندگان
چکیده
In this paper, we give a survey of methods used to calculate values resistance distance (also known as effective resistance) in graphs. Resistance has played prominent role not only circuit theory and chemistry, but also combinatorial matrix spectral graph theory. Moreover applications ranging from quantifying biological structures, distributed control systems, network analysis, power grid systems. discuss both exact techniques approximate for each method discussed provide an illustrative example. We present some open questions conjectures.
منابع مشابه
Finding common structured patterns in linear graphs
A linear graph is a graph whose vertices are linearly ordered. This linear ordering allows pairs of disjoint edges to be either preceding (<), nesting (@) or crossing (G). Given a family of linear graphs, and a non-empty subset R ⊆ {<,@, G}, we are interested in the Maximum Common Structured Pattern (MCSP) problem: find a maximum size edgedisjoint graph, with edge pairs all comparable by one of...
متن کاملNew Resistance Distances with Global Information on Large Graphs
We consider the problem that on large random geometric graphs, random walk-based distances between nodes do not carry global information such as cluster structure. Instead, as the graphs become larger, the distances contain mainly the obsolete information of local density of the nodes. Many distances or similarity measures between nodes on a graph have been proposed but none are both proved to ...
متن کاملAlgorithmic Approach for finding Convolutional
PONNALA, LALIT Algorithmic Approach for finding Convolutional Code generators for the Translation Initiation of Escherichia coli K-12. (Under the direction of Professor Donald L. Bitzer and Professor Winser E. Alexander). Using error-control coding theory, we parallel the functionality of the translation of mRNA into amino acids to the decoding of noisy parity streams that have been encoded usi...
متن کاملResistance distances and the Kirchhoff index in Cayley graphs
In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: a b s t r a c t In this paper, closed-form formulae for the Kirchhoff index and resistance distances of the Cayley graphs ov...
متن کاملOn finding augmenting graphs
Method of augmenting graphs is a general approach to solve the maximum independent set problem. As the problem is generally NP-hard, no polynomial-time algorithms are available to implement the method. However, when restricted to particular classes of graphs, the approach may lead to efficient solutions. A famous example of this nature is the matching algorithm: it finds a maximum matching in a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2022
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2022.04.012