Results 31 to 40 of about 5,325,408 (241)
On the Perspectives Opened by Right Angle Crossing Drawings
Journal of Graph Algorithms and Applications, 2011 Right Angle Crossing (RAC) drawings are polyline drawings where each crossing forms four right angles. RAC drawings have been introduced because cognitive experiments provided evidence that increasing the number of crossings does not decrease the ...
Patrizio Angelini +6 more
doaj +1 more source
Column planarity and partially-simultaneous geometric embedding
Journal of Graph Algorithms and Applications, 2017 We introduce the notion of column planarity of a subset $R$ of the vertices of a graph $G$. Informally, we say that $R$ is column planar in $G$ if we can assign $x$-coordinates to the vertices in $R$ such that any assignment of $y$-coordinates to ...
Luis Barba +5 more
doaj +1 more source
Morphing Planar Graph Drawings Through 3D
Computing in Geometry and Topology, 2023 In this paper, we investigate crossing-free 3D morphs between planar straight-line drawings. We show that, for any two (not necessarily topologically equivalent) planar straight-line drawings of an n-vertex planar graph, there exists a piecewise-linear ...
Kevin Buchin +6 more
doaj +1 more source
Journal of Graph Algorithms and Applications, 2012 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.
Patrizio Angelini +4 more
doaj +1 more source
Straight-line drawing of quadrangulations
, 2006 . This article introduces a straight-line drawing algorithm for quadrangulations, in the family of the face-counting algorithms. It outputs in linear time a drawing on a regular W ×H grid such that W +H = n − 1 − ∆, where n is the number of vertices and ∆
Éric Fusy, Fusy, Éric
core +1 more source
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
, 1997 Hierarchical graphs and clustered graphs are useful nonclassical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures.
Feng, Qing-Wen +5 more
core +1 more source
Peripheral lysosomes recruit PLEKHG3 to focal adhesions and restrain protrusion dynamics
FEBS Letters, EarlyView.Proximity‐dependent labeling at the LAMTOR complex revealed the Rho GEF PLEKHG3 as a lysosome‐proximal protein directing the study toward the influence of lysosome positioning on actin dynamics and cell motility. We show that PLEKHG3 colocalizes with lysosomes at focal adhesion sites and observe that forced peripheral dispersion of lysosomes hinders ...
Rainer Ettelt +8 more
wiley +1 more source
FEBS Letters, EarlyView.This review focuses on the role of autophagy and mitophagy in maintaining pancreatic β‐cell function and homeostasis. We discuss how genetic defects affecting these pathways contribute to the development of type 1, type 2, monogenic, and gestational diabetes. We further explore their potential as therapeutic targets. Created in BioRender.
Yunkyeong Lee +2 more
wiley +1 more source
Membrane composition and thermodynamic identity as boundaries of life for synthetic cell research
FEBS Letters, EarlyView.What makes a cell a cell? The boundary of a living cell is not just a wall. Read as a Markov blanket, the membrane separates internal from external states, generating identity and non‐equilibrium order. Can this identity be rebuilt from scratch in a synthetic cell?
Caterina Presutti, Bert Poolman
wiley +1 more source
Cubic graphs have bounded slope parameter
Journal of Graph Algorithms and Applications, 2010 We show that every finite connected graph G with maximum degree three and with at least one vertex of degree smaller than three has a straight-line drawing in the plane satisfying the following conditions.
Balázs Keszegh +3 more
doaj +1 more source