Dynamic Breadth First Search with Predictions
Fuente:
arXiv
Saved in:
| Main Authors: | Khan, Shahbaz, Verma, Shubham Kumar, Lohiya, Utkarsh |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Efficient Semi-External Breadth-First Search
by: Wan, Xiaolong, et al.
Published: (2025)
by: Wan, Xiaolong, et al.
Published: (2025)
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)
Practical algorithms for Hierarchical overlap graphs
by: Talera, Saumya, et al.
Published: (2024)
by: Talera, Saumya, et al.
Published: (2024)
Evaluating Optimal Safe Flows Decomposition for RNA Assembly
by: Ahmed, Bashar, et al.
Published: (2024)
by: Ahmed, Bashar, et al.
Published: (2024)
Engineering Semi-streaming DFS algorithms
by: Bhagavan, Kancharla Nikhilesh, et al.
Published: (2024)
by: Bhagavan, Kancharla Nikhilesh, et al.
Published: (2024)
Testing Depth First Search Numbering
by: Czumaj, Artur, et al.
Published: (2025)
by: Czumaj, Artur, et al.
Published: (2025)
Tree Search With Predictions
by: Dinitz, Michael, et al.
Published: (2026)
by: Dinitz, Michael, et al.
Published: (2026)
Competitive Search in the Line and the Star with Predictions
by: Angelopoulos, Spyros
Published: (2023)
by: Angelopoulos, Spyros
Published: (2023)
Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings
by: Elberfeld, Michael, et al.
Published: (2025)
by: Elberfeld, Michael, et al.
Published: (2025)
Hardness Amplification for Dynamic Binary Search Trees
by: Jiang, Shunhua, et al.
Published: (2024)
by: Jiang, Shunhua, et al.
Published: (2024)
Parameterizing Path Partitions
by: Fernau, Henning, et al.
Published: (2022)
by: Fernau, Henning, et al.
Published: (2022)
Dynamic Rank, Basis, and Matching
by: Brand, Jan van den, et al.
Published: (2026)
by: Brand, Jan van den, et al.
Published: (2026)
Parameterized Saga of First-Fit and Last-Fit Coloring
by: Agrawal, Akanksha, et al.
Published: (2024)
by: Agrawal, Akanksha, 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)
Binary Search with Distributional Predictions
by: Dinitz, Michael, et al.
Published: (2024)
by: Dinitz, Michael, et al.
Published: (2024)
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)
The Kernighan-Lin Search Algorithm
by: Dasdan, Ali
Published: (2025)
by: Dasdan, Ali
Published: (2025)
Local Search k-means++ with Foresight
by: Conrads, Theo, et al.
Published: (2024)
by: Conrads, Theo, et al.
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)
First Passage Percolation with Queried Hints
by: Karntikoon, Kritkorn, et al.
Published: (2024)
by: Karntikoon, Kritkorn, et al.
Published: (2024)
Sum Estimation via Vector Similarity Search
by: Mussmann, Stephen, et al.
Published: (2026)
by: Mussmann, Stephen, et al.
Published: (2026)
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)
Searching 2D-Strings for Matching Frames
by: Boneh, Itai, et al.
Published: (2023)
by: Boneh, Itai, et al.
Published: (2023)
Noisy (Binary) Searching: Simple, Fast and Correct
by: Dereniowski, Dariusz, et al.
Published: (2021)
by: Dereniowski, Dariusz, et al.
Published: (2021)
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)
Scalable $k$-clique Densest Subgraph Search
by: Ye, Xiaowei, et al.
Published: (2024)
by: Ye, Xiaowei, et al.
Published: (2024)
First Order Stochastic Optimization with Oblivious Noise
by: Diakonikolas, Ilias, et al.
Published: (2024)
by: Diakonikolas, Ilias, et al.
Published: (2024)
Preprocessing to Reduce the Search Space for Odd Cycle Transversal
by: Jansen, Bart M. P., et al.
Published: (2024)
by: Jansen, Bart M. P., et al.
Published: (2024)
Local Search-based Individually Fair Clustering with Outliers
by: Maity, Binita, et al.
Published: (2025)
by: Maity, Binita, et al.
Published: (2025)
Complexity of Local Search for CSPs Parameterized by Constraint Difference
by: Anand, Aditya, et al.
Published: (2025)
by: Anand, Aditya, et al.
Published: (2025)
A k-swap Local Search for Makespan Scheduling
by: Rohwedder, Lars, et al.
Published: (2024)
by: Rohwedder, Lars, 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)
Automating the Search for Small Hard Examples to Approximation Algorithms
by: Sharma, Eklavya
Published: (2025)
by: Sharma, Eklavya
Published: (2025)
Skyline-First Traversal as a Control Mechanism for Multi-Criteria Graph Search
by: Tacheny, Nicolas
Published: (2026)
by: Tacheny, Nicolas
Published: (2026)
On the FirstFit Algorithm for Online Unit-Interval Coloring
by: Krekelberg, Bob, et al.
Published: (2025)
by: Krekelberg, Bob, et al.
Published: (2025)
Practical Parallel Block Tree Construction: First Results
by: Clausecker, Robert, et al.
Published: (2025)
by: Clausecker, Robert, 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)
Similar Items
-
Efficient Semi-External Breadth-First Search
by: Wan, Xiaolong, et al.
Published: (2025) -
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) -
Practical algorithms for Hierarchical overlap graphs
by: Talera, Saumya, et al.
Published: (2024) -
Evaluating Optimal Safe Flows Decomposition for RNA Assembly
by: Ahmed, Bashar, et al.
Published: (2024)