Results 21 to 30 of about 262,244 (186)
Aesthetic Discrimination of Graph Layouts [PDF]
This paper addresses the following basic question: given two layouts of the same graph, which one is more aesthetically pleasing? We propose a neural network-based discriminator model trained on a labeled dataset that decides which of two layouts has a higher aesthetic quality.
Klammler, M., McHedlidze, T., Pak, A.
openaire +4 more sources
A Tabu Search Based Approach for Graph Layout [PDF]
This paper describes an automated tabu search based method for drawing general graph layouts with straight lines. To our knowledge, this is the first time tabu methods have been applied to graph drawing.
BAYKASOGLU +32 more
core +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
Consistent graph layout for weighted graphs [PDF]
Summary form only given. In this paper, we present three algorithms that build graph layouts for undirected, weighted graphs. Our goal is to generate layouts that are consistent with the weights in the graph. We introduce tree algorithms and show that they can be successful in solving the problem up to a certain precision.
D. Vrajitoru, J. Deboni
openaire +1 more source
Queue Layouts of Graph Products and Powers [PDF]
A \emphk-queue layout of a graph G consists of a linear order σ of V(G), and a partition of E(G) into k sets, each of which contains no two edges that are nested in σ .
David R. Wood
doaj +3 more sources
Feasible Sanitary Sewer Network Generation Using Graph Theory
A graph theory-based methodology is proposed for the sewer system optimization problem in this study. Sewer system optimization includes two subproblems: layout optimization and hydraulic design optimization, which can be solved independently or solved ...
Mustafa Erkan Turan +3 more
doaj +1 more source
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
The Perception of Graph Properties in Graph Layouts [PDF]
AbstractWhen looking at drawings of graphs, questions about graph density, community structures, local clustering and other graph properties may be of critical importance for analysis. While graph layout algorithms have focused on minimizing edge crossing, symmetry, and other such layout properties, there is not much known about how these algorithms ...
Soni, Utkarsh +5 more
openaire +2 more sources
BFL: a node and edge betweenness based fast layout algorithm for large scale networks
Background Network visualization would serve as a useful first step for analysis. However, current graph layout algorithms for biological pathways are insensitive to biologically important information, e.g.
Kojima Kaname +3 more
doaj +1 more source
Image generation models from scene graphs and layouts: A comparative analysis
An image is the abstraction of a thousand words. The meaning and essence of complex topics, ideas, and concepts can be easily and effectively conveyed visually by a single image rather than a lengthy verbal description.
Muhammad Umair Hassan +2 more
doaj +1 more source

