Efficient Point-to-Point Resistance Distance Queries in Large Graphs

DOI10.7155/jgaa.00612OpenAlexW4322096632MaRDI QIDQ5886033

Kai Hormann, Craig Gotsman

Publication date: 30 March 2023

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00612

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Uses Software

• METIS

Cites Work

• Unnamed Item
• Spectral partitioning works: planar graphs and finite element meshes
• Algorithmic techniques for finding resistance distances on structured graphs
• A recursion formula for resistance distances and its applications
• Incremental Computation of Pseudo-Inverse of Laplacian
• Fast link prediction for large networks using spectral embedding
• A Separator Theorem for Planar Graphs
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• Nested Dissection of a Regular Finite Element Mesh
• Graphs and matrices
• Balanced line separators of unit disk graphs
• Graph Sparsification by Effective Resistances

This page was built for publication: Efficient Point-to-Point Resistance Distance Queries in Large Graphs