Results 191 to 200 of about 57,181 (227)
Some of the next articles are maybe not open access.
IISA 2014, The 5th International Conference on Information, Intelligence, Systems and Applications, 2014
We extend the recently introduced slanted-orthogonal (for short: slog) drawing model to a new relaxed model that we call sloggy, which allows crossings not exclusively on diagonals but also on rectilinear edge segments. Because of that, sloggy drawings might require much less bends than the corresponding drawings in the slog drawing model.
Michael A. Bekos +2 more
openaire +1 more source
We extend the recently introduced slanted-orthogonal (for short: slog) drawing model to a new relaxed model that we call sloggy, which allows crossings not exclusively on diagonals but also on rectilinear edge segments. Because of that, sloggy drawings might require much less bends than the corresponding drawings in the slog drawing model.
Michael A. Bekos +2 more
openaire +1 more source
2004
Graph drawing addresses the problem of constructing geometric representations of graphs, and has important applications to key computer technologies such as software engineering, database systems, visual interfaces, and computer-aided-design. Research on graph drawing has been conducted within several diverse areas, including discrete mathematics ...
LIOTTA, Giuseppe, Tamassia R.
openaire +2 more sources
Graph drawing addresses the problem of constructing geometric representations of graphs, and has important applications to key computer technologies such as software engineering, database systems, visual interfaces, and computer-aided-design. Research on graph drawing has been conducted within several diverse areas, including discrete mathematics ...
LIOTTA, Giuseppe, Tamassia R.
openaire +2 more sources
2020
A graph is planar if it can be drawn or embedded in the plane so that no two edges intersect geometrically except at a vertex to which they are both incident. A plane graph is a planar graph with a fixed planar embedding in the plane. A drawing problem X for a plane graph G asks to determine whether G has a drawing D satisfying a set P of given ...
Md. Saidur Rahman 0001 +1 more
openaire +1 more source
A graph is planar if it can be drawn or embedded in the plane so that no two edges intersect geometrically except at a vertex to which they are both incident. A plane graph is a planar graph with a fixed planar embedding in the plane. A drawing problem X for a plane graph G asks to determine whether G has a drawing D satisfying a set P of given ...
Md. Saidur Rahman 0001 +1 more
openaire +1 more source
SIAM Journal on Discrete Mathematics, 1994
Suppose that we have a 2-cell embedding of a graph \(G\) in an orientable surface \(S_ g\) of genus \(g\). The surface can be represented by the standard fundamental polygon that is a convex \((4g)\)-gon in the plane with its sides pairwise identified as \(a_ 1 b_ 1 a^ -_ 1 b^ - _ 1\cdots a_ g b_ g a^ -_ g b^ -_ g\).
openaire +1 more source
Suppose that we have a 2-cell embedding of a graph \(G\) in an orientable surface \(S_ g\) of genus \(g\). The surface can be represented by the standard fundamental polygon that is a convex \((4g)\)-gon in the plane with its sides pairwise identified as \(a_ 1 b_ 1 a^ -_ 1 b^ - _ 1\cdots a_ g b_ g a^ -_ g b^ -_ g\).
openaire +1 more source
Graph Neural Networks for Graph Drawing
IEEE Transactions on Neural Networks and Learning SystemsAccepted for publication in IEEE Transaction of Neural Networks and Learning Systems (TNNLS) 2022, Special Issue on Deep Neural Networks for Graphs: Theory, Models, Algorithms and ...
Matteo Tiezzi +2 more
exaly +8 more sources
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
Rectilinear drawings of graphs
Journal of Graph Theory, 1988AbstractWe consider graphs drawn in the plane such that every edge crosses at most one other edge. We characterize, in terms of two forbidden sub‐configurations, which of these graphs are equivalent to drawings such that all edges are straight line segments.
openaire +2 more sources
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
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
1994
Graph drawing addresses the problem of constructing geometric representations of abstract graphs and networks. It is an emerging area of research that combines flavors of topological graph theory and computational geometry. The automatic generation of drawings of graphs has important applications in key computer technologies such as software ...
Ashim Garg, Roberto Tamassia
openaire +1 more source
Graph drawing addresses the problem of constructing geometric representations of abstract graphs and networks. It is an emerging area of research that combines flavors of topological graph theory and computational geometry. The automatic generation of drawings of graphs has important applications in key computer technologies such as software ...
Ashim Garg, Roberto Tamassia
openaire +1 more source