OGDF Open Graph Drawing Framework. Many aspects of graph drawing research are motivated from practice, and practical evaluation of graph drawing algorithms is essential. However, graph drawing has now grown for several decades and a huge amount of algorithms for various drawing styles and applications has been proposed. Many sophisticated algorithms build upon complex data structures and other algorithms, thus making new implementations from scratch cumbersome and time-consuming. Obviously, graph drawing libraries can ease the implementation of new algorithms a lot. The LEDA-based C++-library AGD was very popular in the past, since it covers a wide range of graph drawing algorithms. However, the lack of publicly available source-code restricted the portability and extendability, not to mention the understanding of the particular implementations. Other currently available graph drawing libraries suffer from the same problems, or are even only commercially available or focus only on special graph layout methods. Our goals for the Open Graph Drawing Framework (OGDF) were to transfer essential design concepts of AGD and to overcome its main deficiencies for use in academic research. The library provides: A wide range of graph drawing algorithms that allow to reuse and replace particular algorithm phases by using a dedicated module mechanism. Sophisticated data structures that are commonly used in graph drawing, equipped with rich public interfaces. Self-contained code that does not require any additional libraries (except for some optional branch-and-cut algorithms). Portable C++-code that supports the most important compilers for Linux, MacOS, and Windows operating systems. Open source code available under the terms of the GNU General Public License version 2 or version 3.

References in zbMATH (referenced in 33 articles )

Showing results 21 to 33 of 33.
Sorted by year (citations)
  1. Binucci, Carla; Chimani, Markus; Didimo, Walter; Liotta, Giuseppe; Montecchiani, Fabrizio: Placing arrows in directed graph drawings (2016)
  2. Chattopadhyay, Amit; Carr, Hamish; Duke, David; Geng, Zhao; Saeki, Osamu: Multivariate topology simplification (2016)
  3. Chimani, Markus; Klein, Karsten; Wiedera, Tilo: A note on the practicality of maximal planar subgraph algorithms (2016)
  4. Lipp, Fabian; Wolff, Alexander; Zink, Johannes: Faster force-directed graph drawing with the well-separated pair decomposition (2016)
  5. Sinnl, Markus; Ljubić, Ivana: A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (2016)
  6. Skambath, Malte; Tantau, Till: Offline drawing of dynamic trees: algorithmics and document integration (2016)
  7. Chimani, Markus; Gutwenger, Carsten: Hypergraph and minor crossing number problems (2015)
  8. Tamassia, Roberto (ed.): Handbook of graph drawing and visualization (2014)
  9. Liers, F.; Pardella, G.: Partitioning planar graphs: a fast combinatorial approach for max-cut (2012)
  10. Chimani, Markus; Gutwenger, Carsten; Mutzel, Petra; Wong, Hoi-Ming: Upward planarization layout (2011)
  11. Liers, F.; Pardella, G.: Simplifying maximum flow computations: the effect of shrinking and good initial flows (2011)
  12. Fanghänel, Diana; Liers, Frauke: A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions (2010)
  13. Buchheim, Christoph; Chimani, Markus; Ebner, Dietmar; Gutwenger, Carsten; Jünger, Michael; Klau, Gunnar W.; Mutzel, Petra; Weiskircher, René: A branch-and-cut approach to the crossing number problem (2008)

Further publications can be found at: http://www.ogdf.net/doku.php/ogdf:publications