Results 51 to 60 of about 51,611 (258)
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
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
, 1995 An Angle graph is a graph with a fixed cyclic order of edges around each vertex and an angle specified for every pair of consecutive edges incident on each vertex. We study the problem of constructing a drawing of an angle graph that preserves its angles, and present several new results.
openaire +1 more source
Drawing Graphs with GLEE [PDF]
, 2008 This paper describes novel methods we developed to lay out graphs using Sugiyama's scheme [16] in a tool named GLEE. The main contributions are: a heuristic for creating a graph layout with a given aspect ratio, an efficient method of edge-crossings counting while performing adjacent vertex swaps, and a simple and fast spline routing algorithm.
Lev Nachmanson +2 more
openaire +1 more source
Recognition and drawing of stick graphs [PDF]
Theoretical Computer Science, 2018 A \emph{Stick graph} is an intersection graph of axis-aligned segments such that the left end-points of the horizontal segments and the bottom end-points of the vertical segments lie on a `ground line,' a line with slope $-1$. It is an open question to decide in polynomial time whether a given bipartite graph $G$ with bipartition $A\cup B$ has a Stick ...
Felice De Luca +4 more
openaire +3 more sources
Intracerebral Hemorrhage Induces Monocyte TNF Signaling in Patients That Is Suppressed by BAF312
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Intracerebral hemorrhage (ICH) causes high morbidity and mortality, with neurotoxic inflammation driven by infiltrating monocytes. This study is an in‐depth longitudinal examination of the immune response during the first week of ICH in the presence and absence of the immunomodulatory drug BAF312 (Siponimod).
Jonathan Howard DeLong +10 more
wiley +1 more source
Drawing planar graphs with many collinear vertices
Journal of Computational Geometry, 2018 Consider the following problem: Given a planar graph $G$, what is the maximum number $p$ such that $G$ has a planar straight-line drawing with $p$ collinear vertices?
Giordano Da Lozzo +4 more
doaj +1 more source
The Graph Drawing Server [PDF]
, 2002 There are many obstacles in the way of someone wishing to make use of existing graph drawing technology— software installation and data conversion can be time-consuming and may be prohibitively difficult for the casual or novice user, and software may be limited to a particular platform or provided interface. The Graph Drawing Server (GDS) [2] seeks to
Stina S. Bridgeman, Roberto Tamassia
openaire +1 more source
Arthritis Care &Research, EarlyView.Objective The objective of this study was to describe the longitudinal disease course and pulmonary outcomes of North American patients with melanoma differentiation–associated protein 5 (MDA5) antibody–associated dermatomyositis (DM). Methods Thirty patients with MDA5 antibody–associated DM were identified in a single‐center longitudinal cohort of 352
Jenice X. Cheah +8 more
wiley +1 more source
A Note on Minimum-Segment Drawings of Planar Graphs
Journal of Graph Algorithms and Applications, 2013 A straight-line drawing of a planar graph G is a planar drawing of G such that each vertex is mapped to a point on the Euclidean plane, each edge is drawn as a straight line segment, and no two edges intersect except possibly at a common endpoint ...
Stephane Durocher +3 more
doaj +1 more source