Mikhail Gudim

Ordered Dags: HypercubeSort

2017 · arXiv (Cornell University)

We generalise the insertion into a binary heap to any directed acyclic graph (DAG) with one source vertex. This lets us formulate a general method for converting any such DAG into a data structure with …