AbstractSeveral data presentation problems involve drawing graphs so that they are easy to read and understand. Examples include circuit schematics and software engineering diagrams. In this paper we present a bibliographic survey on algorithms whose goal is to produce aesthetically pleasing drawings of graphs. Research on this topic is spread over the broad spectrum of Computer Science. This bibliography constitutes an attempt to encompass both theoretical and application oriented papers from disparate areas
Much of graph drawing is based on drawing graphs as node-link diagrams, in which vertices are repres...
Planarity Testing and Embedding Maurizio PatrignaniCrossings and Planarization Christoph Buchheim, M...
We investigate the problem of algorithmically drawing graphs, i.e., the process of creating geometri...
AbstractSeveral data presentation problems involve drawing graphs so that they are easy to read and ...
AbstractIn this paper we present an extensive experimental study comparing four general-purpose grap...
Small Screens and Large Graphs: Area-Efficient Drawings of Planar Combinatorial Structures Fabrizio ...
A graph drawing algorithm produces a layout of a graph in two- or three-dimensional space that shoul...
AbstractThe visualization of conceptual structures is a key component of support tools for complex a...
We compare a collection of graph drawing algorithms implemented in our Graph Ed system. We report on...
Graph Drawing is a relatively young area that combines elements of graph theory, algorithms, (comput...
Graph drawing is a new and growing area in Computer Science. It is concerned with the design, analys...
AbstractMany graph drawing problems are NP-complete. Most of the problems described in this exposito...
A graph drawing algorithm produces a layout of a graph in two- or three-dimensional space that shoul...
A graph is an abstract mathematical representation of a set of objects, called vertices, together wi...
: We present a new algorithm for drawing planar graphs on the plane. It can be viewed as a generaliz...
Much of graph drawing is based on drawing graphs as node-link diagrams, in which vertices are repres...
Planarity Testing and Embedding Maurizio PatrignaniCrossings and Planarization Christoph Buchheim, M...
We investigate the problem of algorithmically drawing graphs, i.e., the process of creating geometri...
AbstractSeveral data presentation problems involve drawing graphs so that they are easy to read and ...
AbstractIn this paper we present an extensive experimental study comparing four general-purpose grap...
Small Screens and Large Graphs: Area-Efficient Drawings of Planar Combinatorial Structures Fabrizio ...
A graph drawing algorithm produces a layout of a graph in two- or three-dimensional space that shoul...
AbstractThe visualization of conceptual structures is a key component of support tools for complex a...
We compare a collection of graph drawing algorithms implemented in our Graph Ed system. We report on...
Graph Drawing is a relatively young area that combines elements of graph theory, algorithms, (comput...
Graph drawing is a new and growing area in Computer Science. It is concerned with the design, analys...
AbstractMany graph drawing problems are NP-complete. Most of the problems described in this exposito...
A graph drawing algorithm produces a layout of a graph in two- or three-dimensional space that shoul...
A graph is an abstract mathematical representation of a set of objects, called vertices, together wi...
: We present a new algorithm for drawing planar graphs on the plane. It can be viewed as a generaliz...
Much of graph drawing is based on drawing graphs as node-link diagrams, in which vertices are repres...
Planarity Testing and Embedding Maurizio PatrignaniCrossings and Planarization Christoph Buchheim, M...
We investigate the problem of algorithmically drawing graphs, i.e., the process of creating geometri...