Results 61 to 70 of about 1,651,918 (300)
, 2005 We prove that a graph is Pfaffian if and only if it can be drawn in the plane (possibly with crossings) so that every perfect matching intersects itself an even number of times.
openaire +1 more source
Rectangular Drawings of Planar Graphs [PDF]
Journal of Algorithms, 2002 Summary: A plane graph is a planar graph with a fixed embedding in the plane. In a rectangular drawing of a plane graph, each vertex is drawn as a point, each edge is drawn as a horizontal or vertical line segment, and each face is drawn as a rectangle.
Md. Saidur Rahman 0001 +2 more
openaire +1 more source
Fully Dynamic 3-Dimensional Orthogonal Graph Drawing
Journal of Graph Algorithms and Applications, 2001 In a 3-dimensional orthogonal drawing of a graph, vertices are mapped to grid points on a 3-dimensional rectangular integer lattice and edges are routed along integer grid lines. In this paper, we present a technique that produces a 3D orthogonal drawing
M. Closson +3 more
doaj +1 more source
Journal of Graph Algorithms and Applications, 2020 We study the problem of drawing a dynamic graph, where each vertex appears in the graph at a certain time and remains in the graph for a fixed amount of time, called the window size.
Manuel Borrazzo +4 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
FEBS Open Bio, EarlyView.Lactoferrin promotes wound healing by activating MAPK, PI3K/Akt, and extracellular matrix pathways, enhancing fibroblast remodeling, proliferation, and re‐epithelialization. These mechanisms highlight its therapeutic potential in inflammation control, tissue repair, and remodeling.
Morgana Lüdtke Azevedo +4 more
wiley +1 more source
Discrete Mathematics & Theoretical Computer Science, 2004 A \emph(k,t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between each pair of colour classes no two monochromatic edges cross.
Vida Dujmović +2 more
doaj +1 more source
, 2014 This report describes the 21st Annual Graph Drawing Contest, held in conjunction with the 2014 Graph Drawing Symposium in Würzburg, Germany.
Gutwenger, Carsten +2 more
core +1 more source
An Interactive System for Drawing Graphs [PDF]
, 1996 . In spite of great advances in the automatic drawing of medium and large graphs, the tools available for drawing small graphs exquisitely (that is, with the aesthetics commonly found in professional publications and presentations) are still very ...
Kathy Ryall +5 more
core +1 more source
FEBS Open Bio, EarlyView.We describe detailed protocols for the purification and preparation of Marchantia polymorpha Auxin Response Factor 2 (MpARF2). This protein is fused to an MBP solubility tag and an mNG fluorescent tag and is purified from Escherichia coli. The presented procedures make it possible to study MpARF2 assemblies, which could arise from phase separation ...
Bas Janssen +5 more
wiley +1 more source