Results 31 to 40 of about 24,958 (160)
How well will LLMs perform for graph layout tasks?
Large Language Models (LLMs) have demonstrated impressive capabilities in various applications, motivating visualization researchers to explore the usage of LLMs for visualization tasks such as automated visualization recommendation, code generation and ...
Yilun Fan +5 more
doaj +1 more source
Layout of random circulant graphs [PDF]
A circulant graph H is defined on the set of vertices V=\left\{ 1,\ldots,n\right\} and edges E=\left\{ \left(i,j\right):\left|i-j\right|\equiv s\left(\textrm{mod}n\right),s\in S\right\} , where S\subseteq\left\{ 1,\ldots,\lceil\frac{n-1}{2}\rceil\right\} . A random circulant graph results from deleting edges of H with probability 1-p.
Sebastian Richter, Israel Rocha
openaire +3 more sources
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
Gregor Betz +4 more
openaire +1 more source
Enumerating Grid Layouts of Graphs
We study algorithms that generate layouts of graphs with $n$ vertices in a square grid with $\nu$ points, where adjacent vertices in the graph are also close in the grid. The problem is motivated by graph drawing and factory layout planning. In the latter application, vertices represent machines, and edges join machines that should be placed next ...
openaire +2 more sources
On Kamada-Kawai graph layout with graph neural networks
Traditional force-directed layout algorithms, such as the Kamada-Kawai (KK) method, are widely used for graph visualization due to their ability to produce aesthetically pleasing layouts.
Olena Linnyk +2 more
doaj +1 more source
Graph Layout with Versatile Boundary Constraints
Graph layouts are in general data dependent and help to reveal structural and attribute relationships in the data set. However, there are situations when one may wish to alter the layout e.g. to emphasize parts of the data set or for aesthetic reasons.
Yani Zhang, Alex Pang
doaj +1 more source
Improved Bounds for Track Numbers of Planar Graphs
A track layout of a graph consists of a vertex coloring and a total order of each color class, such that no two edges cross between any two color classes.
Sergey Pupyrev
doaj +1 more source
Distributed Graph Layout for Sensor Networks
Sensor network applications frequently require that the sensors know their physical locations in some global coordinate system. This is usually achieved by equipping each sensor with a location measurement device, such as GPS. However, low-end systems or
Craig Gotsman, Yehuda Koren
doaj +1 more source
Portable graph layout and editing [PDF]
The Graph Layout Toolkit and the Graph Layout Toolkit are portable, flexible toolkits for graph layout and graph editing systems. The Graph Layout Toolkit contains four highly customizable layout algorithms, and supports hierarchical graphs. The Graph Editor Toolkit is a tightly coupled interactive front end to the Graph Layout Toolkit.
Brendan Madden +3 more
openaire +1 more source
Graph-RWGAN: A Method for Generating House Layouts Based on Multi-Relation Graph Attention Mechanism
We address issues in existing house layout generation methods, including chaotic room layouts, limited iterative refinement, and restricted style diversity.
Ziqi Ye +5 more
doaj +1 more source

