Simpler optimal sorting from a directed acyclic graph

DOI10.1137/1.9781611978315.26MaRDI QIDQ7292121zbMATH OpenFDO

Authors Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann

Publication date 8 July 2026

Full work available at URL https://doi.org/10.1137/1.9781611978315.26

Mathematics Subject Classification ID

No records found.

Cited in

(5)

• Instance-optimal imprecise convex hull
• Simpler universally optimal Dijkstra
• A combinatorial proof of universal optimality for computing a planar convex hull
• Optimal antimatroid sorting
• On the instance optimality of detecting collisions and subgraphs

This page was built for publication: Simpler optimal sorting from a directed acyclic graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7292121)