Geodesic
Efficient Point-to-Point Resistance Distance Queries in Large Graphs
Journal of Graph Algorithms and Applications, Tome 27 (2023) no. 1, pp. 35-44.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

We describe a method to efficiently compute point-to-point resistance distances in a graph, which are notoriously difficult to compute from the raw graph data. Our method is based on a relatively compact hierarchical data structure which ''compresses'' the resistance distance data present in a graph, constructed by a nested bisection of the graph using compact edge-cuts. Built and stored in a preprocessing step (which is amenable to massive parallel processing), efficient traversal of a small portion of this data structure supports efficient and exact answers to resistance distance queries. The size of the resulting data structure for a graph of $n$ vertices is $O(nk\log n)$, where $k$ is the size of a balanced edge-cut of the graph. Exact queries then require $O(k\log n)$ worst-case time and $O(k)$ average-case time. Approximate values may be obtained significantly faster by applying standard dimension reduction techniques to the ''coordinates'' stored in the structure. 
@article{JGAA_2023_27_1_a2,
     author = {Craig Gotsman and Kai Hormann},
     title = {Efficient {Point-to-Point} {Resistance} {Distance} {Queries} in {Large} {Graphs}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {35--44},
     publisher = {mathdoc},
     volume = {27},
     number = {1},
     year = {2023},
     doi = {10.7155/jgaa.00612},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00612/}
}
TY  - JOUR
AU  - Craig Gotsman
AU  - Kai Hormann
TI  - Efficient Point-to-Point Resistance Distance Queries in Large Graphs
JO  - Journal of Graph Algorithms and Applications
PY  - 2023
SP  - 35
EP  - 44
VL  - 27
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00612/
DO  - 10.7155/jgaa.00612
LA  - en
ID  - JGAA_2023_27_1_a2
ER  - 
%0 Journal Article
%A Craig Gotsman
%A Kai Hormann
%T Efficient Point-to-Point Resistance Distance Queries in Large Graphs
%J Journal of Graph Algorithms and Applications
%D 2023
%P 35-44
%V 27
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00612/
%R 10.7155/jgaa.00612
%G en
%F JGAA_2023_27_1_a2
Craig Gotsman; Kai Hormann. Efficient Point-to-Point Resistance Distance Queries in Large Graphs. Journal of Graph Algorithms and Applications, Tome 27 (2023) no. 1, pp. 35-44. doi : 10.7155/jgaa.00612. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00612/

Cité par Sources :