Ordered Dags: HypercubeSort
Data Structures and Algorithms
2017-10-04 v1
Abstract
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 priority queue interface. We apply our method to a hypercube DAG to obtain a sorting algorithm of complexity . As another curious application, we derive a relationship between length of longest path and maximum degree of a vertex in a DAG.
Keywords
Cite
@article{arxiv.1710.00944,
title = {Ordered Dags: HypercubeSort},
author = {Mikhail Gudim},
journal= {arXiv preprint arXiv:1710.00944},
year = {2017}
}