Abstract
Fredman proposed in 1976 the following algorithmic problem: Given are a ground set X, some partial order P over X, and some comparison oracle OL that specifies a linear order L over X that extends P. A query to OL has as input distinct x, x′ ∈ X and outputs whether x
Cite
CITATION STYLE
APA
van der Hoog, I., Rotenberg, E., & Rutschmann, D. (2025). Simpler Optimal Sorting from a Directed Acyclic Graph. In 8th SIAM Symposium on Simplicity of Algorithms, SOSA 2025 (pp. 350–355). Society for Industrial and Applied Mathematics Publications. https://doi.org/10.1137/1.9781611978315.26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free