Algorithms for drawing graphs: an annotated bibliography

Battista, Giuseppe Di; Eades, Peter; Tamassia, Roberto; Tollis, Ioannis G.

doi:10.1016/0925-7721(94)00014-x

Cited by 728 publications

(471 citation statements)

References 91 publications

Supporting

Mentioning

443

Contrasting

Unclassified

Order By: Relevance

“…A dominance drawing of a directed acyclic graph [22] is a drawing of the graph in the plane such that each edge is directed upwards and to the right, such that the axisaligned bounding box of every edge contains no vertices other than its endpoints, and such that no edge can be added to the drawing preserving these properties. The graphs with planar dominance drawings are exactly the transitively reduced st-planar graphs, i.e.…”

Section: Dominance Drawingmentioning

confidence: 99%

Superpatterns and Universal Point Sets

et al. 2013

View full text Add to dashboard Cite

Abstract. An old open problem in graph drawing asks for the size of a universal point set, a set of points that can be used as vertices for straight-line drawings of all n-vertex planar graphs. We connect this problem to the theory of permutation patterns, where another open problem concerns the size of superpatterns, permutations that contain all patterns of a given size. We generalize superpatterns to classes of permutations determined by forbidden patterns, and we construct superpatterns of size n 2 /4 + Θ(n) for the 213-avoiding permutations, half the size of known superpatterns for unconstrained permutations. We use our superpatterns to construct universal point sets of size n 2 /4 − Θ(n), smaller than the previous bound by a 9/16 factor. We prove that every proper subclass of the 213-avoiding permutations has superpatterns of size O(n log O(1) n), which we use to prove that the planar graphs of bounded pathwidth have near-linear universal point sets.

show abstract

Section: Dominance Drawingmentioning

confidence: 99%

Superpatterns and Universal Point Sets

et al. 2013

View full text Add to dashboard Cite

show abstract

“…A two terminal series-parallel digraph (also called TTSP-digraph) is a planar digraph recursively defined as follows [10,11]:…”

Section: Series-parallel Graphs and Their Decomposition Treesmentioning

confidence: 99%

On Point-Sets That Support Planar Graphs

et al. 2012

View full text Add to dashboard Cite

“…Orthogonalization Algorithm The orthogonalization algorithm [16] accepts as its input an embedded 4-planar graph with a fixed external face and produces an orthogonal representation of the graph with the minimal number of bends. We briefly review the algorithm following the description in [4]. For each (undirected) edge with endpoints u and v, call the two possible orientations (u, v) and (v, u) darts.…”

Section: Giotto Implementationmentioning

confidence: 99%

Algorithmic Patterns for Orthogonal Graph Drawing

Gelfand

Tamassia

1998

Graph Drawing

Self Cite

View full text Add to dashboard Cite

Abstract. In this paper, we present an object-oriented design and implementation of the core steps of the giotto algorithm for orthogonal graph drawing. Our design is motivated by the goals of making the algorithm modular and extensible and of providing many reusable components of the algorithm. This work is part of the jdsl project aimed at creating a library of data structures and algorithms in Java.

show abstract

Algorithms for drawing graphs: an annotated bibliography

Cited by 728 publications

References 91 publications

Superpatterns and Universal Point Sets

Superpatterns and Universal Point Sets

On Point-Sets That Support Planar Graphs

Algorithmic Patterns for Orthogonal Graph Drawing

Contact Info

Product

Resources

About