4 citations · 4 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2023★ 4 cited
The Eclipse Layout Kernel
Sören Domrös, Reinhard von Hanxleden, Miro Spönemann +2
The Eclipse Layout Kernel (ELK) is a collection of graph drawing algorithms that supports compound graph layout and ports as explicit anchor points of edges. It is available as ope…
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…