1 citations · 1 across the 4 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DS2011
Worst-Case Optimal Priority Queues via Extended Regular Counters
Amr Elmasry, Jyrki Katajainen
We consider the classical problem of representing a collection of priority queues under the operations \Findmin{}, \Insert{}, \Decrease{}, \Meld{}, \Delete{}, and \Deletemin{}. In…
cs.DS2011
The Open Graph Archive: A Community-Driven Effort
Christian Bachmaier, Franz J. Brandenburg, Philip Effinger +6
In order to evaluate, compare, and tune graph algorithms, experiments on well designed benchmark sets have to be performed. Together with the goal of reproducibility of experimenta…