Results 31 to 40 of about 28,541 (252)
The Complexity of Angular Resolution
Journal of Graph Algorithms and Applications, 2023 The angular resolution of a straight-line drawing of a graph is the smallest angle formed by any two edges incident to a vertex. The angular resolution of a graph is the supremum of the angular resolutions of all straight-line drawings of the graph.
Marcus Schaefer
doaj +1 more source
An Experimental Study on the Ply Number of Straight-Line Drawings
Journal of Graph Algorithms and Applications, 2017 The ply number of a drawing is a new criterion of interest for graph drawing. Informally, the ply number of a straight-line drawing of a graph is defined as the maximum number of overlapping disks, where each disk is associated with a vertex and has a radius that is half the length of the longest edge incident to that vertex.
De Luca F. +4 more
openaire +4 more sources
Drawing Planar Graphs with Reduced Height
Journal of Graph Algorithms and Applications, 2017 A polyline (resp., straight-line) drawing $\Gamma$ of a planar graph $G$ on a set $L_k$ of $k$ parallel lines is a planar drawing that maps each vertex of $G$ to a distinct point on $L_k$ and each edge of $G$ to a polygonal chain (resp ...
Stephane Durocher, Debajyoti Mondal
doaj +1 more source
Journal of Graph Algorithms and Applications, 2019 We study the problem of computing straight-line drawings of non-planar graphs with few crossings. We assume that a crossing-minimization algorithm is applied first, yielding a planarization, i.e., a planar graph with a dummy vertex for each ...
Thomas Bläsius +2 more
doaj +1 more source
Multilayer Drawings of Clustered Graphs
Journal of Graph Algorithms and Applications, 2014 The cluster adjacency graph of a flat clustered graph C(G,T) is the graph A whose vertices are the clusters in T and whose edges connect clusters containing vertices that are adjacent in G.
Fabrizio Frati
doaj +1 more source
The Complexity of Drawing a Graph in a Polygonal Region
Journal of Graph Algorithms and Applications, 2022 We prove that the following problem is complete for the existential theory of the reals: Given a planar graph and a polygonal region, with some vertices of the graph assigned to points on the boundary of the region, place the remaining vertices to ...
Anna Lubiw +2 more
doaj +1 more source
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area
Journal of Graph Algorithms and Applications, 2012 We study the classic graph drawing problem of drawing a planar graph using straight-line edges with a prescribed convex polygon as the outer face. Unlike previous algorithms for this problem, which may produce drawings with exponential area, our method ...
Erin Chambers +3 more
doaj +1 more source
Upward Planar Drawings with Three and More Slopes
Journal of Graph Algorithms and Applications, 2023 The slope number of a graph $G$ is the smallest number of slopes needed for the segments representing the edges in any straight-line drawing of $G$. It serves as a measure of the visual complexity of a graph drawing.
Jonathan Klawitter, Johannes Zink
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Acute lymphoblastic leukaemia (ALL) is one of the most treatable forms of paediatric cancer; however, there is a substantial burden of treatment‐related toxicities (TRTs). In addition, the long‐term changes in children's health‐related quality of life (HRQoL) due to toxic treatments are not well understood.
Clare Ghows +19 more
wiley +1 more source
Computing Radial Drawings on the Minimum Number of Circles
Journal of Graph Algorithms and Applications, 2005 A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings of planar graphs by using the minimum number of concentric circles.
Emilio Di Giacomo +3 more
doaj +1 more source