Results 81 to 90 of about 2,072,739 (293)
Planar L-Drawings of Directed Graphs
, 2017 We study planar drawings of directed graphs in the L-drawing standard. We provide necessary conditions for the existence of these drawings and show that testing for the existence of a planar L-drawing is an NP-complete problem.
A Garg +12 more
core +2 more sources
Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition
International Symposium Graph Drawing and Network Visualization, 2015 The force-directed paradigm is one of the few generic approaches to drawing graphs. Since force-directed algorithms can be extended easily, they are used frequently.
Fabian Lipp, A. Wolff, Johannes Zink
semanticscholar +1 more source
FEBS Open Bio, EarlyView.Light activation of the photoswitchable cannabinoid ligand azo‐HU308 triggers Ca2+ influx in pancreatic β‐cells through TRPC channels, independent of CB2 cannabinoid receptors. This reveals a non‐GPCR pathway for cannabinoid modulation of β‐cell Ca2+ dynamics and establishes azo‐HU308 as an optical tool to study cannabinoid signaling through TRP ...
Alexander E. G. Viray, James A. Frank
wiley +1 more source
The maximum number of edges of bipartite 1-planar graphs with 1-disk drawings
AKCE International Journal of Graphs and CombinatoricsA graph is 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. Let G be a bipartite 1-planar graph with bipartition sets X and Y. A 1-disk [Formula: see text] drawing of G is a 1-planar drawing such that all vertices
Guiping Wang
doaj +1 more source
Sensors, 2015 Due to the wide deployment of wireless local area networks (WLAN), received signal strength (RSS)-based indoor WLAN localization has attracted considerable attention in both academia and industry.
Mu Zhou +5 more
doaj +1 more source
Experiments and a User Study for Hierarchical Drawings of Graphs
IEEE Access, 2023 We present a detailed hierarchical graph drawing technique that is based on the Path Based Framework (PBF). Extensive edge bundling is applied to draw all edges of the graph and the height of the drawing is minimized using compaction.
Panagiotis Lionakis +2 more
doaj +1 more source
Achieving Good Angular Resolution in 3D Arc Diagrams [PDF]
, 2013 We study a three-dimensional analogue to the well-known graph visualization approach known as arc diagrams. We provide several algorithms that achieve good angular resolution for 3D arc diagrams, even for cases when the arcs must project to a given 2D ...
A. Cimikowski +17 more
core +2 more sources
Online Dynamic Graph Drawing [PDF]
IEEE Transactions on Visualization and Computer Graphics, 2008 This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user's mental map, while allowing arbitrary modifications between consecutive layouts. The algorithm works online and uses various execution culling methods in order to reduce the layout time and ...
Yaniv, Frishman, Ayellet, Tal
openaire +2 more sources
FEBS Open Bio, EarlyView.Clinical analysis reveals significant dysregulation of FGFRL1 in esophageal cancer (EC) patients. RNAi‐coupled next‐generation sequencing (NGS) and in vitro study reveal FGFRL1‐mediated EC progression via EMT, PI3K/Akt, and Notch pathways. Functional assays confirm its role in tumor growth, migration, and invasion.
Aprajita Srivastava +3 more
wiley +1 more source
Choosing Colors for Geometric Graphs via Color Space Embeddings
, 2006 Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. After the geometric embedding is specified, there is an additional step that is often overlooked or ignored: assigning ...
Dillencourt, Michael B. +2 more
core +1 more source