Results 11 to 20 of about 426,579 (276)
-shaped point set embeddings of high-degree plane graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A point set embedding of a given plane graph on a given point set on a plane is a drawing of where each vertex is drawn on a point in . An orthogonal point set embedding of a plane graph is a point set embedding of such that each edge is drawn as a ...
Shaheena Sultana, Md. Saidur Rahman
doaj +1 more source
BC tree-based spectral sampling for big complex network visualization
Applied Network Science, 2021 Graph sampling methods have been used to reduce the size and complexity of big complex networks for graph mining and visualization. However, existing graph sampling methods often fail to preserve the connectivity and important structures of the original ...
Jingming Hu +7 more
doaj +1 more source
Examining graphic drawing skills for a socioscientific problem situation
LUMAT, 2022 The aim of the study is to examine the graphing skills of prospective elementary mathematics teachers for a socioscientific problem situation related to Covid-19.
Mehmet İhsan Yurtyapan +1 more
doaj +1 more source
A graph rewriting programming language for graph drawing [PDF]
, 1998 This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process.
Rodgers, Peter
core +1 more source
Journal of Graph Algorithms and Applications, 2005 Summary: The task of drawing subgraphs is often underestimated and they are simply emphasized using different colors or line styles. In this paper, we present an approach for drawing graphs within graphs that first produces a layout for the subgraphs thus increasing their locality.
Holleis, Paul +2 more
openaire +1 more source
Journal of Graph Algorithms and Applications, 2011 Summary: We study a new standard for visualizing graphs: A monotone drawing is a straight-line drawing such that, for every pair of vertices, there exists a path that monotonically increases with respect to some direction. We show algorithms for constructing monotone planar drawings of trees and biconnected planar graphs, we study the interplay between
ANGELINI, PATRIZIO +4 more
+6 more sources
Lower Bounds on the Area Requirements of Series-Parallel Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Graphs and ...
Fabrizio Frati
doaj +1 more source
Upward Three-Dimensional Grid Drawings of Graphs [PDF]
, 2005 A \emph{three-dimensional grid drawing} of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges do not cross. Our aim is to produce three-dimensional grid drawings
A. Garg +27 more
core +3 more sources
Modifying Orthogonal Drawings for Label Placement
Algorithms, 2016 In this paper, we investigate how one can modify an orthogonal graph drawing to accommodate the placement of overlap-free labels with the minimum cost (i.e., minimum increase of the area and preservation of the quality of the drawing).
Konstantinos G. Kakoulis +1 more
doaj +1 more source
Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We study the following problem: Given $k$ paths that share the same vertex set, is there a simultaneous geometric embedding of these paths such that each individual drawing is monotone in some direction?
David Bremner +8 more
doaj +1 more source