Algorithms for drawing graphs: An annotated bibliography
From MaRDI portal
Publication:1337400
DOI10.1016/0925-7721(94)00014-XzbMath0804.68001WikidataQ56226599 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)
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C85: Graph algorithms (graph-theoretic aspects)
68-00: General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science
00A15: Bibliographies for mathematics in general
Related Items
Evolutionary graph drawing algorithms, Unnamed Item, A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT, Optimal three-dimensional layout of interconnection networks, Directed rectangle-visibility graphs have unbounded dimension, Multilayer grid embeddings for VLSI, Algorithms for computing a parameterized \(st\)-orientation, A note on minimum-area upward drawing of complete and Fibonacci trees, Simple and efficient floor-planning, Exact wirelength of hypercubes on a grid, Lower bounds for planar orthogonal drawings of graphs, Area requirement and symmetry display of planar upward drawings, A note on optimal area algorithms for upward drawings of binary trees, Minimum-width grid drawings of plane graphs, A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs, Strictly-upward drawings of ordered search trees, Advances in the theory and practice of graph drawing, Edge crossings in drawings of bipartite graphs, Drawing graphs in two layers, At most single-bend embeddings of cubic graphs, 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, Triangulating planar graphs while minimizing the maximum degree, The decision support system GMCR in environmental conflict management, ARC crossing minimization in hierarchical digraphs with tabu search, 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 rectangle of influence drawability problem, Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems, Rectangular grid drawings of plane graphs, The Gifi system of descriptive multivariate analysis., Three-dimensional orthogonal graph drawing algorithms, Spring algorithms and symmetry, A new lower bound for the bipartite crossing number with applications, Removing edge-node intersections in drawings of graphs, An optimal layout of multigrid networks, A tabu search algorithm for the bipartite drawing problem, Algorithms for the fixed linear crossing number problem, Higher order Delaunay triangulations, Fixed edge-length graph drawing is NP-hard, An algorithm for drawing general undirected graphs, Bipolar orientations revisited, Computers and discovery in algebraic graph theory, Two-dimensional packing algorithms for layout of disconnected graphs, Graph multidimensional scaling with self-organizing maps, Optimizing area and aspect ratio in straight-line orthogonal tree drawings, On embedding an outer-planar graph in a point set, Towards area requirements for drawing hierarchically planar graphs, Proximity drawings in polynomial area and volume, Upward planarity testing, Drawing planar graphs using the canonical ordering, Characterizing proximity trees, On the computational complexity of edge concentration, Visualizing SAT instances and runs of the DPLL algorithm, A framework and algorithms for circular drawings of graphs, Triangulating with high connectivity., An experimental comparison of four graph drawing algorithms., An analysis of some linear graph layout heuristics, Algorithms for drawing binary trees in the plane., Unnamed Item, Unnamed Item, DRAWING DIRECTED ACYCLIC GRAPHS: AN EXPERIMENTAL STUDY, Automatic layout of statecharts
