Saved in:
| Main Authors: | Wan, Xiaolong, Han, Xixian |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2507.12925 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Dynamic Breadth First Search with Predictions
by: Khan, Shahbaz, et al.
Published: (2026)
by: Khan, Shahbaz, et al.
Published: (2026)
Fast and Efficient Parallel Breadth-First Search with Power-law Graph Transformation
by: Jiang, Zite, et al.
Published: (2020)
by: Jiang, Zite, et al.
Published: (2020)
Breadth-First Search Trees with Many or Few Leaves
by: Beisegel, Jesse, et al.
Published: (2026)
by: Beisegel, Jesse, et al.
Published: (2026)
Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings
by: Elberfeld, Michael, et al.
Published: (2025)
by: Elberfeld, Michael, et al.
Published: (2025)
Testing Depth First Search Numbering
by: Czumaj, Artur, et al.
Published: (2025)
by: Czumaj, Artur, et al.
Published: (2025)
Buffered Partially-Persistent External-Memory Search Trees
by: Brodal, Gerth Stølting, et al.
Published: (2025)
by: Brodal, Gerth Stølting, et al.
Published: (2025)
The Case for External Graph Sketching
by: Bender, Michael A., et al.
Published: (2025)
by: Bender, Michael A., et al.
Published: (2025)
Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks
by: Bilò, Davide, et al.
Published: (2024)
by: Bilò, Davide, et al.
Published: (2024)
Efficient Algorithms for Adversarially Robust Approximate Nearest Neighbor Search
by: Andoni, Alexandr, et al.
Published: (2026)
by: Andoni, Alexandr, et al.
Published: (2026)
Towards Efficient Data Structures for Approximate Search with Range Queries
by: Kian, Ladan, et al.
Published: (2026)
by: Kian, Ladan, et al.
Published: (2026)
Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions
by: Wan, Zongqi, et al.
Published: (2024)
by: Wan, Zongqi, et al.
Published: (2024)
Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space
by: Jang, Jihoon, et al.
Published: (2025)
by: Jang, Jihoon, et al.
Published: (2025)
Improved Space-Efficient Approximate Nearest Neighbor Search Using Function Inversion
by: McCauley, Samuel
Published: (2024)
by: McCauley, Samuel
Published: (2024)
Minimizers in Semi-Dynamic Strings
by: Zuba, Wiktor, et al.
Published: (2025)
by: Zuba, Wiktor, et al.
Published: (2025)
On Characterizations for Language Generation: Interplay of Hallucinations, Breadth, and Stability
by: Kalavasis, Alkis, et al.
Published: (2024)
by: Kalavasis, Alkis, et al.
Published: (2024)
Parallel Greedy Best-First Search with a Bound on Expansions Relative to Sequential Search
by: Shimoda, Takumi, et al.
Published: (2024)
by: Shimoda, Takumi, et al.
Published: (2024)
Semi-Streaming Algorithms for Hypergraph Matching
by: Reinstädtler, Henrik, et al.
Published: (2025)
by: Reinstädtler, Henrik, et al.
Published: (2025)
Engineering Semi-streaming DFS algorithms
by: Bhagavan, Kancharla Nikhilesh, et al.
Published: (2024)
by: Bhagavan, Kancharla Nikhilesh, et al.
Published: (2024)
Semi-Robust Communication Complexity of Maximum Matching
by: Huete, Gabriel Cipriani, et al.
Published: (2025)
by: Huete, Gabriel Cipriani, et al.
Published: (2025)
qPMS Sigma -- An Efficient and Exact Parallel Algorithm for the Planted $(l, d)$ Motif Search Problem
by: Dhar, Saurav, et al.
Published: (2024)
by: Dhar, Saurav, et al.
Published: (2024)
Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits
by: Ye, Zichun, et al.
Published: (2025)
by: Ye, Zichun, et al.
Published: (2025)
Beyond Brooks: $(Δ-1)$-Coloring in Semi-Streaming
by: Flin, Maxime, et al.
Published: (2026)
by: Flin, Maxime, et al.
Published: (2026)
Stochastic Knapsack: Semi-Adaptivity Gaps and Improved Approximation
by: Barak, Zohar, et al.
Published: (2026)
by: Barak, Zohar, et al.
Published: (2026)
Faster Semi-streaming Matchings via Alternating Trees
by: Mitrović, Slobodan, et al.
Published: (2024)
by: Mitrović, Slobodan, et al.
Published: (2024)
Semi-Streaming Algorithms for Weighted $k$-Disjoint Matchings
by: Ferdous, S M, et al.
Published: (2023)
by: Ferdous, S M, et al.
Published: (2023)
Tree Search With Predictions
by: Dinitz, Michael, et al.
Published: (2026)
by: Dinitz, Michael, et al.
Published: (2026)
Optimizing Search Strategies: A Study of Two-Pointer Linear Search Implementation
by: Zinnia, Nazma Akter, et al.
Published: (2024)
by: Zinnia, Nazma Akter, et al.
Published: (2024)
Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order
by: Buchbinder, Niv, et al.
Published: (2026)
by: Buchbinder, Niv, et al.
Published: (2026)
Skyline-First Traversal as a Control Mechanism for Multi-Criteria Graph Search
by: Tacheny, Nicolas
Published: (2026)
by: Tacheny, Nicolas
Published: (2026)
The Kernighan-Lin Search Algorithm
by: Dasdan, Ali
Published: (2025)
by: Dasdan, Ali
Published: (2025)
Finding a Shortest $M$-link Path in a Monge Directed Acyclic Graph
by: Wan, Joy Z.
Published: (2024)
by: Wan, Joy Z.
Published: (2024)
Search Trees on Trees via LP
by: Sadeh, Yaniv, et al.
Published: (2025)
by: Sadeh, Yaniv, et al.
Published: (2025)
Hierarchical Multicriteria Shortest Path Search
by: Kurbanov, Temirlan, et al.
Published: (2025)
by: Kurbanov, Temirlan, et al.
Published: (2025)
Competitive Search in the Line and the Star with Predictions
by: Angelopoulos, Spyros
Published: (2023)
by: Angelopoulos, Spyros
Published: (2023)
Local Search k-means++ with Foresight
by: Conrads, Theo, et al.
Published: (2024)
by: Conrads, Theo, et al.
Published: (2024)
Fully Dynamic Breadth First Search and Spanning Trees in Directed Graphs
by: Morse, Gregory, et al.
Published: (2026)
by: Morse, Gregory, et al.
Published: (2026)
First Passage Percolation with Queried Hints
by: Karntikoon, Kritkorn, et al.
Published: (2024)
by: Karntikoon, Kritkorn, et al.
Published: (2024)
Quantization for Vector Search under Streaming Updates
by: Aden-Ali, Ishaq, et al.
Published: (2025)
by: Aden-Ali, Ishaq, et al.
Published: (2025)
Graph-Based Algorithms for Diverse Similarity Search
by: Anand, Piyush, et al.
Published: (2025)
by: Anand, Piyush, et al.
Published: (2025)
Local Search for Clustering in Almost-linear Time
by: Jiang, Shaofeng H. -C., et al.
Published: (2025)
by: Jiang, Shaofeng H. -C., et al.
Published: (2025)
Similar Items
-
Dynamic Breadth First Search with Predictions
by: Khan, Shahbaz, et al.
Published: (2026) -
Fast and Efficient Parallel Breadth-First Search with Power-law Graph Transformation
by: Jiang, Zite, et al.
Published: (2020) -
Breadth-First Search Trees with Many or Few Leaves
by: Beisegel, Jesse, et al.
Published: (2026) -
Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings
by: Elberfeld, Michael, et al.
Published: (2025) -
Testing Depth First Search Numbering
by: Czumaj, Artur, et al.
Published: (2025)