28 citations · 244 across the 83 of their papers we have counts for
Showing 2014 · cs.DSShow all
2 papers · 2 filters
cs.DS2014★ 7 cited
Fibonacci Heaps Revisited
Haim Kaplan, Robert E. Tarjan, Uri Zwick
The Fibonacci heap is a classic data structure that supports deletions in logarithmic amortized time and all other heap operations in O(1) amortized time. We explore the design spa…
cs.DS2014★ 1 cited
Adjacency labeling schemes and induced-universal graphs
Stephen Alstrup, Haim Kaplan, Mikkel Thorup +1
We describe a way of assigning labels to the vertices of any undirected graph on up to vertices, each composed of bits, such that given the labels of two vertices, a…