Results 21 to 30 of about 260,743 (188)
Journal of Graph Algorithms and Applications, 2014 Summary: We consider orthogonal upward drawings of directed acyclic graphs 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. To overcome one of the drawbacks of the Sugiyama Framework, namely, unnecessary edge crossings caused by an unfortunate layer ...
Betz, Gregor +4 more
openaire +2 more sources
Aesthetic Discrimination of Graph Layouts [PDF]
Journal of Graph Algorithms and Applications, 2018 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
Layout of random circulant graphs [PDF]
Linear Algebra and its Applications, 2018 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
Queue Layouts of Graph Products and Powers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 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
Consistent graph layout for weighted graphs [PDF]
The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005., 2005 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
Feasible Sanitary Sewer Network Generation Using Graph Theory
Advances in Civil Engineering, 2019 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
SWING: A system for visualizing web graphs [PDF]
, 2011 A Web graph refers to the graph that is used to represent relationships between Web pages in cyberspace, where a node represents a URL and an edge indicates a link between two URLs. A Web graph is a very huge graph as growing with cyberspace.
Huang, ML, Huang, X, Lai, W
core +2 more sources
How well will LLMs perform for graph layout tasks?
Visual InformaticsLarge 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
BFL: a node and edge betweenness based fast layout algorithm for large scale networks
BMC Bioinformatics, 2009 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
The Perception of Graph Properties in Graph Layouts [PDF]
Computer Graphics Forum, 2018 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