Algorithms for drawing graphs: An annotated bibliography
From MaRDI portal
Publication:1337400
DOI10.1016/0925-7721(94)00014-XzbMath0804.68001OpenAlexW1992709202WikidataQ56226599 ScholiaQ56226599MaRDI QIDQ1337400
Roberto Tamassia, Giuseppe Di Battista, Peter Eades, Ioannis. G. Tollis
Publication date: 30 November 1994
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0925-7721(94)00014-x
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00) Bibliographies for mathematics in general (00A15)
Related Items
Algorithms for the fixed linear crossing number problem ⋮ Higher order Delaunay triangulations ⋮ Drawing graphs in two layers ⋮ At most single-bend embeddings of cubic graphs ⋮ Area requirement of visibility representations of trees ⋮ Proximity drawings in polynomial area and volume ⋮ Relating bends and size in orthogonal graph drawings ⋮ Self-organizing maps for drawing large graphs ⋮ Triangulations without minimum-weight drawing ⋮ On the approximability of two tree drawing conventions ⋮ Lower bounds for dynamic transitive closure, planar point location, and parentheses matching ⋮ Computing proximity drawings of trees in the 3-dimensional space ⋮ The logic engine and the realization problem for nearest neighbor graphs ⋮ The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings ⋮ Drawing outerplanar minimum weight triangulations ⋮ Grid embedding of 4-connected plane graphs ⋮ RECURRENCE-BASED TIME SERIES ANALYSIS BY MEANS OF COMPLEX NETWORK METHODS ⋮ A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT ⋮ Upward planarity testing ⋮ Unnamed Item ⋮ Triangulating planar graphs while minimizing the maximum degree ⋮ The decision support system GMCR in environmental conflict management ⋮ Unnamed Item ⋮ ARC crossing minimization in hierarchical digraphs with tabu search ⋮ Computing orthogonal drawings with the minimum number of bends ⋮ The slotted online one-sided crossing minimization problem on 2-regular graphs ⋮ Drawing planar graphs using the canonical ordering ⋮ Characterizing proximity trees ⋮ An annotated bibliography on 1-planarity ⋮ Linear area upward drawings of AVL trees ⋮ New results on drawing angle graphs ⋮ Algorithms for area-efficient orthogonal drawing ⋮ Universal 3-dimensional visibility representations for graphs ⋮ A note on parallel algorithms for optimal h-v drawings of binary trees ⋮ A better heuristic for orthogonal graph drawings ⋮ The topological drawing of a graph: construction methods ⋮ The rectangle of influence drawability problem ⋮ Nearest neighbour graph realizability is NP-hard ⋮ On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem ⋮ Orthogonal drawing of high degree graphs with small area and few bends ⋮ Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems ⋮ Rectangular grid drawings of plane graphs ⋮ How to draw a planar clustered graph ⋮ A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout ⋮ Independent sets in Line of Sight networks ⋮ Optimal Embedding of Locally Twisted Cubes into Grids ⋮ Finding Large Independent Sets in Line of Sight Networks ⋮ Multilayer grid embeddings for VLSI ⋮ Bend-optimal orthogonal drawings of triconnected plane graphs ⋮ DRAWING DIRECTED ACYCLIC GRAPHS: AN EXPERIMENTAL STUDY ⋮ The Gifi system of descriptive multivariate analysis. ⋮ On the computational complexity of edge concentration ⋮ Lower bounds for planar orthogonal drawings of graphs ⋮ Modifying orthogonal drawings for label placement ⋮ Visualizing SAT instances and runs of the DPLL algorithm ⋮ PLANARITY TESTING AND CONSTRUCTING THE TOPOLOGICAL DRAWING OF A PLANE GRAPH (DFS) ⋮ Area requirement and symmetry display of planar upward drawings ⋮ A framework and algorithms for circular drawings of graphs ⋮ Directed rectangle-visibility graphs have unbounded dimension ⋮ Unnamed Item ⋮ Drawing graphs with attribute graph grammars ⋮ Algorithms for computing a parameterized \(st\)-orientation ⋮ Triangulating with high connectivity. ⋮ An experimental comparison of four graph drawing algorithms. ⋮ A note on optimal area algorithms for upward drawings of binary trees ⋮ A note on minimum-area upward drawing of complete and Fibonacci trees ⋮ An analysis of some linear graph layout heuristics ⋮ Optimal three-dimensional layout of interconnection networks ⋮ Automatic layout of statecharts ⋮ Testing gap \(k\)-planarity is NP-complete ⋮ Simple and efficient floor-planning ⋮ Open problems on graph eigenvalues studied with AutoGraphiX ⋮ Minimum-width grid drawings of plane graphs ⋮ A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs ⋮ Evolutionary graph drawing algorithms ⋮ Fixed edge-length graph drawing is NP-hard ⋮ Connecting the dots (with minimum crossings) ⋮ Strictly-upward drawings of ordered search trees ⋮ Exact wirelength of hypercubes on a grid ⋮ An algorithm for drawing general undirected graphs ⋮ Three-dimensional orthogonal graph drawing algorithms ⋮ Advances in the theory and practice of graph drawing ⋮ Spring algorithms and symmetry ⋮ A new lower bound for the bipartite crossing number with applications ⋮ Bipolar orientations revisited ⋮ HOTVis: Higher-Order Time-Aware Visualisation of Dynamic Graphs ⋮ Computers and discovery in algebraic graph theory ⋮ Two-dimensional packing algorithms for layout of disconnected graphs ⋮ Graph multidimensional scaling with self-organizing maps ⋮ Algorithms for drawing binary trees in the plane. ⋮ Optimizing area and aspect ratio in straight-line orthogonal tree drawings ⋮ On embedding an outer-planar graph in a point set ⋮ Removing edge-node intersections in drawings of graphs ⋮ An optimal layout of multigrid networks ⋮ A Linear-Time Algorithm for Finding Induced Planar Subgraphs ⋮ Edge crossings in drawings of bipartite graphs ⋮ A tabu search algorithm for the bipartite drawing problem ⋮ Towards area requirements for drawing hierarchically planar graphs ⋮ Some two-vertex resistances of nested triangle network ⋮ Optimization of mixture models on time series networks encoded by visibility graphs: an analysis of the US electricity market ⋮ Area-efficient algorithms for upward straight-line tree drawings ⋮ A more compact visibility representation ⋮ An annotated review on graph drawing and its applications ⋮ On the construction of planar embedding for a class of orthogonal polyhedra ⋮ On-line convex planarity testing ⋮ Two algorithms for finding rectangular duals of planar graphs ⋮ Algorithmic graph embeddings ⋮ Rectangular grid drawings of plane graphs
