Efficient Point-to-Point Resistance Distance Queries in Large Graphs
From MaRDI portal
Recommendations
- Algorithmic techniques for finding resistance distances on structured graphs
- Robust distance queries on massive networks
- Faster Approximation of Distances in Graphs
- Resistance distances in vertex-weighted complete multipartite graphs
- Graph sparsification by effective resistances
- Improved distance queries in planar graphs
- Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks
- Linear-time graph distance and diameter approximation
Cites work
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A recursion formula for resistance distances and its applications
- A Separator Theorem for Planar Graphs
- Algorithmic techniques for finding resistance distances on structured graphs
- Balanced line separators of unit disk graphs
- Fast link prediction for large networks using spectral embedding
- Graph sparsification by effective resistances
- Graphs and matrices
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- Incremental computation of pseudo-inverse of Laplacian
- Nested Dissection of a Regular Finite Element Mesh
- Spectral partitioning works: planar graphs and finite element meshes
Cited in
(2)
This page was built for publication: Efficient Point-to-Point Resistance Distance Queries in Large Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886033)
