Export Citations
2 Results for: Keyword: graph proximity
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
Searched The ACM Guide to Computing Literature (3,842,307 records)|Limit your search to The ACM Full-Text Collection (774,409 records)
Showing 1 - 2of2 Results
Select All
- research-articleMay 2024
Efficient and Provable Effective Resistance Computation on Large Graphs: An Index-based Approach
Proceedings of the ACM on Management of Data (PACMMOD), Volume 2, Issue 3Article No.: 133, Pages 1–27https://doi.org/10.1145/3654936Effective resistance (ER) is a fundamental metric for measuring node similarities in a graph, and it finds applications in various domains including graph clustering, recommendation systems, link prediction, and graph neural networks. The state-of-the-...
- research-articleMay 2023
Efficient Resistance Distance Computation: The Power of Landmark-based Approaches
Proceedings of the ACM on Management of Data (PACMMOD), Volume 1, Issue 1Article No.: 68, Pages 1–27https://doi.org/10.1145/3588922Resistance distance is a fundamental metric to measure the similarity between two nodes in graphs which has been widely used in many real-world applications. In this paper, we study two problems on approximately computing resistance distance: (i) single-...
