BD-Index: Scalable Biharmonic Distance Queries on Large Graphs via Divide-and-Conquer Indexing
Fuente:
arXiv
Saved in:
| Main Authors: | Pan, Yueyang, Liao, Meihao, Li, Rong-Hua |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach
by: Liao, Meihao, et al.
Published: (2025)
by: Liao, Meihao, et al.
Published: (2025)
Scalable and Provable Kemeny Constant Computation on Static and Dynamic Graphs: A 2-Forest Sampling Approach
by: Li, Cheng, et al.
Published: (2025)
by: Li, Cheng, et al.
Published: (2025)
Improved Algorithms for Effective Resistance Computation on Graphs
by: Yang, Yichun, et al.
Published: (2025)
by: Yang, Yichun, et al.
Published: (2025)
Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach
by: Yang, Yichun, et al.
Published: (2024)
by: Yang, Yichun, et al.
Published: (2024)
Scalable Similarity Search over Large Attributed Bipartite Graphs
by: Ou, Xi, et al.
Published: (2025)
by: Ou, Xi, et al.
Published: (2025)
Gapped String Indexing in Subquadratic Space and Sublinear Query Time
by: Bille, Philip, et al.
Published: (2022)
by: Bille, Philip, et al.
Published: (2022)
Querying in Constant Expected Time with Learned Indexes
by: Croquevielle, Luis, et al.
Published: (2024)
by: Croquevielle, Luis, et al.
Published: (2024)
ProbeWalk: Fast Estimation of Biharmonic Distance on Graphs via Probe-Driven Random Walks
by: Zheng, Dehong, et al.
Published: (2025)
by: Zheng, Dehong, et al.
Published: (2025)
Multidimensional Quantum Walks, Recursion, and Quantum Divide & Conquer
by: Jeffery, Stacey, et al.
Published: (2024)
by: Jeffery, Stacey, et al.
Published: (2024)
A Note on Quantum Divide and Conquer for Minimal String Rotation
by: Wang, Qisheng
Published: (2022)
by: Wang, Qisheng
Published: (2022)
Implementation Of Dynamic De Bruijn Graphs Via Learned Index
by: Nigrelli, Riccardo
Published: (2024)
by: Nigrelli, Riccardo
Published: (2024)
String Indexing with Compressed Patterns
by: Bille, Philip, et al.
Published: (2019)
by: Bille, Philip, et al.
Published: (2019)
Fast Answering Pattern-Constrained Reachability Queries with Two-Dimensional Reachability Index
by: Yang, Huihui, et al.
Published: (2025)
by: Yang, Huihui, et al.
Published: (2025)
Graph Reconstruction via MIS Queries
by: Konrad, Christian, et al.
Published: (2024)
by: Konrad, Christian, et al.
Published: (2024)
Scalable $k$-clique Densest Subgraph Search
by: Ye, Xiaowei, et al.
Published: (2024)
by: Ye, Xiaowei, et al.
Published: (2024)
GraphBLAS Mathematical Opportunities: Parallel Hypersparse, Matrix Based Graph Streaming, and Complex-Index Matrices
by: Jananthan, Hayden, et al.
Published: (2025)
by: Jananthan, Hayden, et al.
Published: (2025)
Better Indexing for Rectangular Pattern Matching
by: Gawrychowski, Paweł, et al.
Published: (2025)
by: Gawrychowski, Paweł, et al.
Published: (2025)
Compressed Index with Construction in Compressed Space
by: Kosolobov, Dmitry
Published: (2026)
by: Kosolobov, Dmitry
Published: (2026)
String Indexing for Top-$k$ Close Consecutive Occurrences
by: Bille, Philip, et al.
Published: (2020)
by: Bille, Philip, et al.
Published: (2020)
Learning Partitions using Rank Queries
by: Chakrabarty, Deeparnab, et al.
Published: (2024)
by: Chakrabarty, Deeparnab, et al.
Published: (2024)
Scalable Exact Hierarchical Agglomerative Clustering via Sparse Geographic Distance Graphs
by: Maus, Victor, et al.
Published: (2026)
by: Maus, Victor, et al.
Published: (2026)
Space-Efficient k-Mismatch Text Indexes
by: Kociumaka, Tomasz, et al.
Published: (2025)
by: Kociumaka, Tomasz, et al.
Published: (2025)
Indexing Tries within Entropy-Bounded Space
by: Carfagna, Lorenzo, et al.
Published: (2025)
by: Carfagna, Lorenzo, et al.
Published: (2025)
Text Indexing and Pattern Matching with Ephemeral Edits
by: Pissis, Solon P.
Published: (2025)
by: Pissis, Solon P.
Published: (2025)
Indexing Strings with Utilities
by: Bernardini, Giulia, et al.
Published: (2025)
by: Bernardini, Giulia, et al.
Published: (2025)
FliX: Flipped-Indexing for Scalable GPU Queries and Updates
by: Kharal, Rosina, et al.
Published: (2026)
by: Kharal, Rosina, et al.
Published: (2026)
Effective Index Construction Algorithm for Optimal $(k,η)$-cores Computation
by: Sun, Shengli, et al.
Published: (2025)
by: Sun, Shengli, et al.
Published: (2025)
Tight Pair Query Lower Bounds for Matching and Earth Mover's Distance
by: Azarmehr, Amir, et al.
Published: (2025)
by: Azarmehr, Amir, et al.
Published: (2025)
Improved Time-Space Tradeoffs for 3SUM-Indexing
by: Dinur, Itai, et al.
Published: (2025)
by: Dinur, Itai, et al.
Published: (2025)
The CDAWG Index and Pattern Matching on Grammar-Compressed Strings
by: Cleary, Alan M., et al.
Published: (2024)
by: Cleary, Alan M., et al.
Published: (2024)
Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks
by: Bilò, Davide, et al.
Published: (2024)
by: Bilò, Davide, et al.
Published: (2024)
Parallel Dynamic Spatial Indexes
by: Men, Ziyang, et al.
Published: (2026)
by: Men, Ziyang, et al.
Published: (2026)
Faster Construction of a Planar Distance Oracle with Õ(1) Query Time
by: Boneh, Itai, et al.
Published: (2025)
by: Boneh, Itai, et al.
Published: (2025)
FlexFlood: Efficiently Updatable Learned Multi-dimensional Index
by: Hidaka, Fuma, et al.
Published: (2024)
by: Hidaka, Fuma, et al.
Published: (2024)
Dynamic Grammar-Compressed Self-Index in $δ$-Optimal Space
by: Nishimoto, Takaaki, et al.
Published: (2026)
by: Nishimoto, Takaaki, et al.
Published: (2026)
Space-Efficient Text Indexing with Mismatches using Function Inversion
by: Bibbens, Jackson, et al.
Published: (2026)
by: Bibbens, Jackson, et al.
Published: (2026)
Fast Biclique Counting on Bipartite Graphs: A Node Pivot-based Approach
by: Ye, Xiaowei, et al.
Published: (2024)
by: Ye, Xiaowei, et al.
Published: (2024)
Optimal Distance Labeling for Permutation Graphs
by: Gawrychowski, Paweł, et al.
Published: (2024)
by: Gawrychowski, Paweł, et al.
Published: (2024)
Graph Spanners for Group Steiner Distances
by: Bilò, Davide, et al.
Published: (2024)
by: Bilò, Davide, et al.
Published: (2024)
Distances in Planar Graphs are Almost for Free!
by: Mozes, Shay, et al.
Published: (2026)
by: Mozes, Shay, et al.
Published: (2026)
Similar Items
-
Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach
by: Liao, Meihao, et al.
Published: (2025) -
Scalable and Provable Kemeny Constant Computation on Static and Dynamic Graphs: A 2-Forest Sampling Approach
by: Li, Cheng, et al.
Published: (2025) -
Improved Algorithms for Effective Resistance Computation on Graphs
by: Yang, Yichun, et al.
Published: (2025) -
Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach
by: Yang, Yichun, et al.
Published: (2024) -
Scalable Similarity Search over Large Attributed Bipartite Graphs
by: Ou, Xi, et al.
Published: (2025)