Hierarchical Exponential Search Via K-Spines
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912673542701056 |
|---|---|
| author | Dong, Bob |
| author_facet | Dong, Bob |
| contents | We introduce the concept of a k-spine of a tree. A k-spine is essentially a path in the tree whose removal leaves only "less-bushy" components of a smaller pathwidth. Using a k-spine as a central guide, we introduce an O(klog dist) exponential search algorithm on a tree by searching mainly along the spine to narrow down the target's vicinity and then recursively handling the smaller components. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_22837 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Hierarchical Exponential Search Via K-Spines Dong, Bob Data Structures and Algorithms F.2.2 We introduce the concept of a k-spine of a tree. A k-spine is essentially a path in the tree whose removal leaves only "less-bushy" components of a smaller pathwidth. Using a k-spine as a central guide, we introduce an O(klog dist) exponential search algorithm on a tree by searching mainly along the spine to narrow down the target's vicinity and then recursively handling the smaller components. |
| title | Hierarchical Exponential Search Via K-Spines |
| topic | Data Structures and Algorithms F.2.2 |
| url | https://arxiv.org/abs/2510.22837 |