Topological heapsort generalizes to antimatroids, yielding optimal running time and O(log|P|) comparisons for antimatroid-constrained sorting.
Brown and Robert Endre Tarjan
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 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.