Open Access
The Open Graph Drawing Framework
Markus Chimani,Carsten Gutwenger,Michael Jünger,Gunnar W. Klau,Karsten Klein,Petra Mutzel +5 more
- 01 Jan 2013
- pp 543-570
48
TL;DR: The 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.
read more
Abstract: 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:
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Visual Traffic Jam Analysis Based on Trajectory Data
TL;DR: An interactive system for visual analysis of urban traffic congestion based on GPS trajectories that provides multiple views for visually exploring and analyzing the traffic condition of a large city as a whole, on the level of propagation graphs, and on road segment level.
Thinning out Steiner trees: a node-based model for uniform edge costs
Matteo Fischetti,Markus Leitner,Ivana Ljubić,Martin Luipersbeck,Michele Monaci,Max Resch,Domenico Salvagnin,Markus Sinnl +7 more
TL;DR: This paper focuses on a model that only involves node variables, which is rather appealing for the “uniform” cases where all edges have the same cost, and shows that this new model allows one to quickly produce very good solutions for notoriously hard instances from the literature.
Visualizing large graphs
TL;DR: There is a growing need for algorithms and techniques for visualizing very large and complex graphs as mentioned in this paper, and a review of layout algorithms and interactive exploration techniques for large graphs can be found in this article.
The Tulip 3 Framework: A Scalable Software Library for Information Visualization Applications Based on Relational Data
David Auber,Daniel Archambault,Romain Bourqui,Antoine Lambert,Morgan Mathiaut,Patrick Mary,Maylis Delest,Jonathan Dubois,Guy Melançon +8 more
- 13 Jan 2012
TL;DR: Tulip, an information visualization framework dedicated to the analysis and visualization of relational data, is presented, consisting of a suite of tools and techniques, that can be used to address a large variety of domain-specific problems.
Evaluating Effects of Background Stories on Graph Perception.
Ying Zhao,Jingcheng Shi,Liu Jiawei,Jian Zhao,Fangfang Zhou,Wenzhi Zhang,Kangyi Chen,Xin Zhao,Chunyao Zhu,Wei Chen +9 more
TL;DR: Zhang et al. as discussed by the authors investigated the effects of background stories on graph perception, including visual focus areas, graph structure identification, and mental model formation, and designed three controlled experiments to test their hypotheses using real-world graphs with background stories.
45
References
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
TL;DR: The consecutive ones test for the consecutive ones property in matrices and for graph planarity is extended to a test for interval graphs using a recently discovered fast recognition algorithm for chordal graphs.
1.7K
Optimal scheduling for two-processor systems
Edward G. Coffman,Ron Graham +1 more
TL;DR: It is proved that the algorithm gives optimal solutions and its application to preemptive scheduling disciplines is discussed.
623
Scaling J2EE™ application servers with the multi-tasking virtual machine
TL;DR: The Multi-tasking Virtual Machine (MVM) solves the problem of proliferation of server instances by providing an efficient and scalable implementation of the isolate API for multiple, isolated tasks, enabling the co-location of multiple server instances in a single MVM process.
An experimental evaluation of multilevel layout methods
Gereon Bartel,Carsten Gutwenger,Karsten Klein,Petra Mutzel +3 more
- 21 Sep 2010
TL;DR: This work presents an experimental study that investigates the influence of varying combinations with respect to running time and quality criteria in multilevel layout algorithms.
•Journal Article
Exact crossing minimization
Christoph Buchheim,Dietmar Ebner,Michael Jünger,Gunnar W. Klau,Petra Mutzel,René Weiskircher +5 more
TL;DR: In this article, the authors present an integer linear programming (ILP) approach to compute the crossing number of general sparse graphs of moderate size, and present computational results on a popular benchmark set of graphs.
35
Related Papers (5)
Markus Chimani,Carsten Gutwenger,Karsten Klein,Petra Mutzel +3 more
- 16 Feb 2007
Michael Kaufmann,Dorothea Wagner +1 more
- 01 May 2001
[...]
Martin Mader
- 01 Jan 2008