Topological heapsort generalizes to antimatroids, yielding optimal running time and O(log|P|) comparisons for antimatroid-constrained sorting.
An almost optimal algorithm for unbounded searching
1 Pith paper cite this work, alongside 312 external citations. Polarity classification is still indexing.
1
Pith paper citing it
312
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Optimal antimatroid sorting
Topological heapsort generalizes to antimatroids, yielding optimal running time and O(log|P|) comparisons for antimatroid-constrained sorting.