Results 61 to 70 of about 262,244 (186)
Circular layout in the Graph Layout toolkit [PDF]
The Graph Layout Toolkit is a family of portable, automated, graph layout libraries designed for integration into graphical user interface application programs. The Circular Library is one of the four styles currently available with the Graph Layout Toolkit. It produces layouts that emphasize natural group structures inherent in a graph's topology, and
Uğur Doğrusöz +2 more
openaire +1 more source
Column-Based Graph Layouts [PDF]
We consider orthogonal upward drawings of directed acyclic graphs (DAGs) with nodes of uniform width but node-specific height. One way to draw such graphs is to use a layering technique as provided by the Sugiyama framework [10]. However, to avoid drawbacks of the Sugiyama framework we use the layer-free upward crossing minimization algorithm suggested
Betz, Gregor +4 more
openaire +1 more source
Building a High-Performance Graph Storage on Top of Tree-Structured Key-Value Stores
Graph databases have gained widespread adoption in various industries and have been utilized in a range of applications, including financial risk assessment, commodity recommendation, and data lineage tracking.
Heng Lin +6 more
doaj +1 more source
Telemaco: A Language Oriented Tool for Graph-based Models Layout Optimization
Progress of ICT is shifting the paradigm of systems organization towards a distributed approach, in which physical deployment of components influences the evaluation of systems properties. This contribution can be considered as a problem of graph layout
Mauro Iacono, Stefano Marrone
doaj +1 more source
Product recognition in store shelves as a sub-graph isomorphism problem
The arrangement of products in store shelves is carefully planned to maximize sales and keep customers happy. However, verifying compliance of real shelves to the ideal layout is a costly task routinely performed by the store personnel. In this paper, we
DG Lowe +8 more
core +1 more source
Linear Layouts of Bipartite Planar Graphs
A linear layout of a graph $ G $ consists of a linear order $\prec$ of the vertices and a partition of the edges. A part is called a queue (stack) if no two edges nest (cross), that is, two edges $ (v,w) $ and $ (x,y) $ with $ v \prec x \prec y \prec w $ ($ v \prec x \prec w \prec y $) may not be in the same queue (stack).
Förster, Henry +6 more
openaire +3 more sources
Perceptual Organization in User-Generated Graph Layouts [PDF]
Many graph layout algorithms optimize visual characteristics to achieve useful representations. Implicitly, their goal is to create visual representations that are more intuitive to human observers. In this paper, we asked users to explicitly manipulate nodes in a network diagram to create layouts that they felt best captured the relationships in the ...
Ham, van, F.J.J., Rogowitz, B.
openaire +2 more sources
Graphs from Features: Tree-Based Graph Layout for Feature Analysis
Feature Analysis has become a very critical task in data analysis and visualization. Graph structures are very flexible in terms of representation and may encode important information on features but are challenging in regards to layout being adequate ...
Rosane Minghim +4 more
doaj +1 more source
Solar farm cable layout optimization as a graph problem
We introduce the Solar Farm Cable Layout Problem (SoFaCLaP), a novel graph-theoretic optimization problem. SoFaCLaP formalizes the task of finding a cost-optimal cable layout in a solar farm where PV string positions are already determined but the ...
Sascha Gritzbach +2 more
doaj +1 more source
Graph layout adjustment strategies [PDF]
When adjusting a graph layout, it is often desirable to preserve various properties of the original graph in the adjusted view. Pertinent properties may include straightness of lines, graph topology, orthogonalities and proximities. A layout adjustment algorithm which can be used to create fisheye views of nested graphs is introduced.
Margaret -Anne D. Storey +1 more
openaire +1 more source

