Results 271 to 280 of about 1,651,918 (300)
Some of the next articles are maybe not open access.
Proceedings of the London Mathematical Society, 1963
W E use the definitions of (11). However, in deference to some recent attempts to unify the terminology of graph theory we replace the term 'circuit' by 'polygon', and 'degree' by 'valency'. A graph G is 3-connected (nodally 3-connected) if it is simple and non-separable and satisfies the following condition; if G is the union of two proper subgraphs H
openaire +1 more source
W E use the definitions of (11). However, in deference to some recent attempts to unify the terminology of graph theory we replace the term 'circuit' by 'polygon', and 'degree' by 'valency'. A graph G is 3-connected (nodally 3-connected) if it is simple and non-separable and satisfies the following condition; if G is the union of two proper subgraphs H
openaire +1 more source
Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data
Proceedings of the 6th International Conference on Information Visualization Theory and Applications, 2015We consider the task of visually exploring relationships (such as established connections, similarity, reachability, etc) among a set of georeferenced entities, i.e., entities that have geographic data associated with them. A novel 2.5D paradigm is proposed that provides a robust and practical solution based on separating and then integrating back ...
DA LOZZO, GIORDANO +5 more
openaire +2 more sources
Characterizing Graph Drawing with Eigenvectors
Journal of Chemical Information and Computer Sciences, 2000Two definitions of the problem of graph drawing are considered, and an analytical solution is provided for each of them. The solutions obtained make use of the eigenvectors of the Laplacian matrix of a related structure. The procedures give good results for symmetrical graphs, and they have already been used for drawing fullerene molecules in the ...
Tomaz Pisanski, John Shawe-Taylor
openaire +2 more sources
1996
Many structures in Information Technology can be modeled as graphs, and the success of the model depends on the appearance of the graph: a good drawing can be worth a thousand words, a poor drawing can confuse and obscure the model. This paper surveys recently developed methods for automatic graph drawing.
openaire +1 more source
Many structures in Information Technology can be modeled as graphs, and the success of the model depends on the appearance of the graph: a good drawing can be worth a thousand words, a poor drawing can confuse and obscure the model. This paper surveys recently developed methods for automatic graph drawing.
openaire +1 more source
Ars Comb., 2001
The authors present an algorithm for constructing a straight line drawing with no crossings on a rectangular representation of the torus for graphs with a toroidal rotation system given (i.e.\ with correctly prescribed cyclic order of the edges at each vertex). This algorithm runs in linear time with respect to the number of vertices.
William L. Kocay +2 more
openaire +2 more sources
The authors present an algorithm for constructing a straight line drawing with no crossings on a rectangular representation of the torus for graphs with a toroidal rotation system given (i.e.\ with correctly prescribed cyclic order of the edges at each vertex). This algorithm runs in linear time with respect to the number of vertices.
William L. Kocay +2 more
openaire +2 more sources
2003
Automatic aesthetic drawing of plane graphs has recently created intense interest due to its broad applications, and as a consequence, a number of drawing methods, such as the straight line drawing, convex drawing, orthogonal drawing, rectangular drawing and box-rectangular drawing, have come out [8,9,3,4,5,6,7, 10,11,14,16,23,29,33].
openaire +1 more source
Automatic aesthetic drawing of plane graphs has recently created intense interest due to its broad applications, and as a consequence, a number of drawing methods, such as the straight line drawing, convex drawing, orthogonal drawing, rectangular drawing and box-rectangular drawing, have come out [8,9,3,4,5,6,7, 10,11,14,16,23,29,33].
openaire +1 more source
Drawing graphs with attribute graph grammars
1996We address the problem of automatically generating layouts for graphs using graph grammars.
Gaby Zinßmeister, Carolyn McCreary
openaire +2 more sources
2003
The spectral approach for graph visualization computes the layout of a graph using certain eigenvectors of related matrices. Some important advantages of this approach are an ability to compute optimal layouts (according to specific requirements) and a very rapid computation time.
openaire +2 more sources
The spectral approach for graph visualization computes the layout of a graph using certain eigenvectors of related matrices. Some important advantages of this approach are an ability to compute optimal layouts (according to specific requirements) and a very rapid computation time.
openaire +2 more sources
Proceedings of the first annual symposium on Computational geometry - SCG '85, 1985
Richard J. Lipton +2 more
openaire +1 more source
Richard J. Lipton +2 more
openaire +1 more source
A Survey on Graph Drawing Beyond Planarity
ACM Computing Surveys, 2020Fabrizio Montecchiani +2 more
exaly