In this paper, we investigate symmetric graph drawing in three dimensions. We show that the problem of drawing a graph with a maximum number of symmetries in three dimensions is NP-hard. Then we present a polynomial time algorithm for finding maximum number of three dimensional symmetries in planar graphs
We propose a force-directed approach for drawing graphs in a nearly symmetric fashion. Our algorithm...
Constructing a visually informative drawing of an abstract graph is a problem of considerable practi...
AbstractIn this paper we present algorithms for drawing series parallel digraphs with as much symmet...
In this paper, we investigate symmetric graph drawing in three dimensions. We show that the problem ...
Symmetry is one of the most important aesthetic criteria in graph drawing because it reveals structu...
AbstractIn this paper, we present a linear time algorithm for constructing linkless drawings of seri...
Abstract Symmetry is one of the most important aesthetic criteria in graph drawing because it reveal...
This paper presents a model for drawing trees symmetrically in three dimensions and a linear time al...
This paper presents a model for drawing trees symmetrically in three dimensions and a linear time al...
This thesis investigates the general problem of constructing meaningful drawings of abstract graphs,...
Constructing symmetric drawings of graphs is NP-hard. In this paper, we present a new method for dra...
Constructing symmetric drawings of graphs is NP-hard. In this paper, we present a new method for dra...
AbstractIn this paper, we present a linear time algorithm for constructing linkless drawings of seri...
Abstract: The automatic construction of good drawings of abstract graphs is a problem of practical i...
AbstractConstructing symmetric drawings of graphs is NP-hard. In this paper, we present a new method...
We propose a force-directed approach for drawing graphs in a nearly symmetric fashion. Our algorithm...
Constructing a visually informative drawing of an abstract graph is a problem of considerable practi...
AbstractIn this paper we present algorithms for drawing series parallel digraphs with as much symmet...
In this paper, we investigate symmetric graph drawing in three dimensions. We show that the problem ...
Symmetry is one of the most important aesthetic criteria in graph drawing because it reveals structu...
AbstractIn this paper, we present a linear time algorithm for constructing linkless drawings of seri...
Abstract Symmetry is one of the most important aesthetic criteria in graph drawing because it reveal...
This paper presents a model for drawing trees symmetrically in three dimensions and a linear time al...
This paper presents a model for drawing trees symmetrically in three dimensions and a linear time al...
This thesis investigates the general problem of constructing meaningful drawings of abstract graphs,...
Constructing symmetric drawings of graphs is NP-hard. In this paper, we present a new method for dra...
Constructing symmetric drawings of graphs is NP-hard. In this paper, we present a new method for dra...
AbstractIn this paper, we present a linear time algorithm for constructing linkless drawings of seri...
Abstract: The automatic construction of good drawings of abstract graphs is a problem of practical i...
AbstractConstructing symmetric drawings of graphs is NP-hard. In this paper, we present a new method...
We propose a force-directed approach for drawing graphs in a nearly symmetric fashion. Our algorithm...
Constructing a visually informative drawing of an abstract graph is a problem of considerable practi...
AbstractIn this paper we present algorithms for drawing series parallel digraphs with as much symmet...
DOI
Add to ORKG