Open Access10.17877/DE290R-7670
OGDF an Open Graph Drawing Framework
Markus Chimani,Carsten Gutwenger,Karsten Klein,Petra Mutzel +3 more
- 16 Feb 2007
20
About: The article was published on 16 Feb 2007. and is currently open access. The article focuses on the topics: Graph (abstract data type) & Graph drawing.
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
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.
A New Approach to Exact Crossing Minimization
Markus Chimani,Petra Mutzel,Immanuel M. Bomze +2 more
- 15 Sep 2008
TL;DR: This paper describes a Branch-and-Cut algorithm, together with a combinatorial column generation scheme, in order to solve the crossing number problem to provable optimality and is able to solve graphs with a crossing number of up to 37.
53
Optimal layout decomposition for double patterning technology
Xiaoping Tang,Minsik Cho +1 more
- 07 Nov 2011
TL;DR: This paper shows that the problem is actually in P and presents a method to decompose a layout for DPT and minimize the number of stitches optimally and results show that the method is even faster than the fast heuristics.
49
Layout Decomposition and Legalization for Double-Patterning Technology
TL;DR: An O(n) layout-coloring heuristic algorithm for DP, which is up to 80× faster than the integer linear program-based approach, which permits an extremely fast runtime (less than 1 min in real time for macro layouts).
32
Crossing Minimization meets Simultaneous Drawing
Markus Chimani,Michael Jünger,Michael Schulz +2 more
- 05 Mar 2008
TL;DR: It is shown how existing heuristic and exact algorithms for the traditional problem can be adapted to the new task of simultaneous crossing minimization, and report on a brief experimental study of their implementations.
References
Graph drawing by force-directed placement
TL;DR: A modification of the spring‐embedder model of Eades for drawing undirected graphs with straight edges is presented, developed in analogy to forces in natural systems, for a simple, elegant, conceptually‐intuitive, and efficient algorithm.
Graph visualization and navigation in information visualization: A survey
TL;DR: This is a survey on graph visualization and navigation techniques, as used in information visualization, which approaches the results of traditional graph drawing from a different perspective.
A technique for drawing directed graphs
TL;DR: A four-pass algorithm for drawing directed graphs is presented, which creates good drawings and is fast.
808
•Proceedings Article
Matrix animation and polar decomposition
Ken Shoemake,Tom Duff +1 more
- 01 Sep 1992
TL;DR: This paper presents a theory and method for decomposing a composite matrix in a meaningful way, proposing that the central issue is rotation extraction, and that the best way to do that is Polar Decomposition.
Using constraints to achieve stability in automatic graph layout algorithms
Karl F. Böhringer,Frances Paulisch +1 more
- 01 Mar 1990
TL;DR: This paper shows how user-specified layout constraints may be easily added to many automatic graph layout algorithms and allows a continuum between manual and automatic layout by allowing the user to specify how stable the graph's layout should be.
103
Related Papers (5)
Stina S. Bridgeman
- 01 Jan 2013
Michael Kaufmann,Dorothea Wagner +1 more
- 01 May 2001
[...]
Martin Mader
- 01 Jan 2008