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
A graph drawing algorithm produces a layout of a graph in two- or three-dimensional space that shoul...
AbstractMany graph drawing problems are NP-complete. Most of the problems described in this exposito...
Our world is full of networks. The linking relationships might be quite abstract, such as friendship...
AbstractSeveral data presentation problems involve drawing graphs so that they are easy to read and ...
We compare a collection of graph drawing algorithms implemented in our Graph Ed system. We report on...
Graph drawing is a new and growing area in Computer Science. It is concerned with the design, analys...
This Master Thesis deals with the drawing algorithms of graphs known from the mathematical theory. T...
A graph drawing algorithm produces a layout of a graph in two- or three-dimensional space that shoul...
Drawing graphs is an important problem that combines flavors of computational geometry and graph the...
We discuss the algorithm engineering aspects of AGD, a software library of algorithms for graph draw...
Small Screens and Large Graphs: Area-Efficient Drawings of Planar Combinatorial Structures Fabrizio ...
Abstract: The main thesis of this paper is that intricate nature of software systems can, and in our...
Graph Drawing is a relatively young area that combines elements of graph theory, algorithms, (comput...
In this paper we consider the class of directed acyclic graphs (DAGs), and present the results of an...
this paper: the spring model algorithm, simulated annealing method and the Sugiyama algorithm. Appli...
A graph drawing algorithm produces a layout of a graph in two- or three-dimensional space that shoul...
AbstractMany graph drawing problems are NP-complete. Most of the problems described in this exposito...
Our world is full of networks. The linking relationships might be quite abstract, such as friendship...
AbstractSeveral data presentation problems involve drawing graphs so that they are easy to read and ...
We compare a collection of graph drawing algorithms implemented in our Graph Ed system. We report on...
Graph drawing is a new and growing area in Computer Science. It is concerned with the design, analys...
This Master Thesis deals with the drawing algorithms of graphs known from the mathematical theory. T...
A graph drawing algorithm produces a layout of a graph in two- or three-dimensional space that shoul...
Drawing graphs is an important problem that combines flavors of computational geometry and graph the...
We discuss the algorithm engineering aspects of AGD, a software library of algorithms for graph draw...
Small Screens and Large Graphs: Area-Efficient Drawings of Planar Combinatorial Structures Fabrizio ...
Abstract: The main thesis of this paper is that intricate nature of software systems can, and in our...
Graph Drawing is a relatively young area that combines elements of graph theory, algorithms, (comput...
In this paper we consider the class of directed acyclic graphs (DAGs), and present the results of an...
this paper: the spring model algorithm, simulated annealing method and the Sugiyama algorithm. Appli...
A graph drawing algorithm produces a layout of a graph in two- or three-dimensional space that shoul...
AbstractMany graph drawing problems are NP-complete. Most of the problems described in this exposito...
Our world is full of networks. The linking relationships might be quite abstract, such as friendship...