Partial order multiway search
From MaRDI portal
Publication:6535268
DOI10.1145/3626956zbMATH Open1541.68297MaRDI QIDQ6535268
Shangqi Lu, Matthias Niewerth, Yufei Tao, Wim Martens
Publication date: 29 November 2023
Published in: ACM Transactions on Database Systems (Search for Journal in Brave)
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the tree search problem with non-uniform costs
- Improved approximation algorithms for the average-case tree searching problem
- An approximation algorithm for binary searching in trees
- On the complexity of searching in trees and partially ordered structures
- On an edge ranking problem of trees and graphs
- Edge ranking and searching in partial orders
- Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- About groups of straight lines
- Building an optimal point-location structure in \(O(\operatorname{sort}(n))\) I/Os
- The binary identification problem for weighted trees
- Optimal edge ranking of trees in polynomial time
- Approximating optimal binary decision trees
- Edge ranking of weighted trees
- A fast planar partition algorithm. I
- Introduction to algorithms
- On Greedy Algorithms for Decision Trees
- Decision trees for entity identification
- On the Complexity of Searching in Trees: Average-Case Minimization
- Approximating Decision Trees with Multiway Branches
- Optimal Search in Trees
- Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
- Decision Trees for Geometric Models
- Topology B-trees and their applications
- Dynamic Planar Point Location in External Memory.
- Deterministic and probabilistic binary search in graphs
- I/O-efficient point location using persistent B-trees
- A framework for searching in graphs in the presence of errors
Related Items (1)
This page was built for publication: Partial order multiway search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535268)
