No article text was recorded for this version.
approximate-guided pruning
Version 1 of 111 papers15 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice
- Blog: Error-tolerant Tree Matching
- Blog: App2Exa: Accelerating Exact kNN Search via Dynamic Cache-Guided Approximation
- Blog: Effective Community Search over Large Spatial Graphs
- Blog: Pruning based Distance Sketches with Provable Guarantees on Random Graphs
- Blog: Fast Top-<i>k</i> Distance Retrieval for Network Structural Proximity Features
- Blog: Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling
- Blog: Cache locality is not enough: High-Performance Nearest Neighbor Search with Product Quantization Fast Scan
- Blog: Towards bridging theory and practice
- Blog: Fast and Exact Top-k Search for Random Walk with Restart
- Blog: Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling
History & citation
Current · Permanent link
- This direction split from Pruned Landmark Labeling for Scalable Graph Distance Queries (73% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_approximate_guided_pruning_6e63005d,
title = {approximate-guided pruning},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/approximate-guided-pruning/rdr_6e63005d903d492f8b69d285d65eb982},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_approximate_guided_pruning_6e63005d_v1,
title = {approximate-guided pruning},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/approximate-guided-pruning/rdr_6e63005d903d492f8b69d285d65eb982/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}