Partial Order Multiway Search
Abstract
References
Index Terms
- Partial Order Multiway Search
Recommendations
Optimal Algorithms for Multiway Search on Partial Orders
PODS '22: Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database SystemsWe study partial order multiway search (POMS), which is a game between an algorithm A and an oracle, played on a directed acyclic graph G known to both parties. First, the oracle picks a vertex t in G called the target. Then, A needs to figure out which ...
On the maximum cardinality search lower bound for treewidth
The Maximum Cardinality Search (MCS) algorithm visits the vertices of a graph in some order, such that at each step, an unvisited vertex that has the largest number of visited neighbours becomes visited. A maximum cardinality search ordering (MCS-...
Replacement Paths via Row Minima of Concise Matrices
Matrix $M$ is $k$-concise if the finite entries of each column of $M$ consist of $k$ or fewer intervals of identical numbers. We give an $O(n+m)$-time algorithm to compute the row minima of any $O(1)$-concise $n\times m$ matrix. Our algorithm yields the ...
Comments
Information & Contributors
Information
Published In
- Editor:
- Christopher Jermaine
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- GRF
- Deutsche Forschungsgemeinschaft (DFG)
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 303Total Downloads
- Downloads (Last 12 months)213
- Downloads (Last 6 weeks)10
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in