Results 41 to 50 of about 57,181 (227)
, 2002 This report describes the Eight Annual Graph Drawing Contest, held in conjunction with the Ninth Graph Drawing Symposium in Vienna, Austria. The purpose of the contest is to monitor and challenge the current state of the graph-drawing technology and to ...
Brandenburg, Franz J. +3 more
core +2 more sources
Mental-Map Preserving Visualisation of Partitioned Networks in Vanted
Journal of Integrative Bioinformatics, 2019 Biological networks can be large and complex, often consisting of different sub-networks or parts. Separation of networks into parts, network partitioning and layouts of overview and sub-graphs are of importance for understandable visualisations of those
Garkov Dimitar +3 more
doaj +1 more source
Design gallery browsers based on 2D and 3D graph drawing [PDF]
, 1997 Many problems in computer-aided design and graphics involve the process of setting and adjusting input parameters to obtain desirable output values. Exploring different parameter settings can be a difficult and tedious task in most such systems.
Andalman, Brad +9 more
core +1 more source
A Simple Method for Network Visualization
Mathematics, 2020 In this article, we present a simple method for network visualization. The proposed method is based on distmesh [P.O. Persson and G. Strang, A simple mesh generator in MATLAB, SIAM Review 46 (2004) pp.
Jintae Park +3 more
doaj +1 more source
On the planar edge-length ratio of planar graphs
Journal of Computational Geometry, 2020 The edge-length ratio of a straight-line drawing of a graph is the ratio between the lengths of the longest and of the shortest edge in the drawing. The planar edge-length ratio of a planar graph is the minimum edge-length ratio of any planar straight ...
Manuel Borrazzo, Fabrizio Frati
doaj +1 more source
Every Graph Admits an Unambiguous Bold Drawing
, 2012 Let r and w be a fixed positive numbers, w < r. In a bold drawing of a graph, every vertex is represented by a disk of radius r, and every edge by a narrow rectangle of width w. We solve a problem of van Kreveld [K09] by showing that every graph admits a
János Pach, Pach, János
core +1 more source
Graph-Drawing Contest Report [PDF]
, 2001 This report describes the Seventh Annual Graph Drawing Contest, held in conjunction with the 2000 Graph Drawing Symposium in Williamsburg, Virginia. The purpose of the contest is to monitor and challenge the current state of the art in graph-drawing ...
Himsolt, Michael +7 more
core +1 more source
Stacks, Queues and Tracks: Layouts of Graph Subdivisions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A \emphk-stack layout (respectively, \emphk-queuelayout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering.
Vida Dujmović, David R. Wood
doaj +1 more source
Molecular Oncology, EarlyView.We have established a humanized orthotopic patient‐derived xenograft (Hu‐oPDX) mouse model of high‐grade serous ovarian cancer (HGSOC) that recapitulates human tumor–immune interactions. Using combined anti‐PD‐L1/anti‐CD73 immunotherapy, we demonstrate the model's improved biological relevance and enhanced translational value for preclinical ...
Luka Tandaric +10 more
wiley +1 more source
On edge-intersection graphs of k-bend paths in grids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Edge-intersection graphs of paths in grids are graphs that can be represented such that vertices are paths in a grid and edges between vertices of the graph exist whenever two grid paths share a grid edge. This type of graphs is motivated by applications
Therese Biedl, Michal Stern
doaj +1 more source