| Soft Heaps Visualized |
2023 |
59 |
The soft heap is an approximate priority queue data structure originally proposed by Bernard Chazelle [3]. Chazelle used it to develop the fastest deterministic algorithm to compute a minimum spanning tree of a connected graph [2]. The soft heap allo... |