Results 31 to 40 of about 1,421,171 (369)
Incremental Grid-like Layout Using Soft and Hard Constraints [PDF]
, 2013 We explore various techniques to incorporate grid-like layout conventions into a force-directed, constraint-based graph layout framework. In doing so we are able to provide high-quality layout---with predominantly axis-aligned edges---that is more ...
A. Barsky +15 more
core +1 more source
Computer Graphics Forum, 2017 AbstractWe propose a new graph layout method based on a modification of the t‐distributed Stochastic Neighbor Embedding (t‐SNE) dimensionality reduction technique. Although t‐SNE is one of the best techniques for visualizing high‐dimensional data as 2D scatterplots, t‐SNE has not been used in the context of classical graph layout.
Kruiger, JF +5 more
openaire +3 more sources
LayoutGMN: Neural Graph Matching for Structural Layout Similarity [PDF]
Computer Vision and Pattern Recognition, 2020 We present a deep neural network to predict structural similarity between 2D layouts by leveraging Graph Matching Networks (GMN). Our network, coined LayoutGMN, learns the layout metric via neural graph matching, using an attention-based GMN designed ...
A. Patil +4 more
semanticscholar +1 more source
Online Dynamic Network Visualization Based on SIPA Layout Algorithm
Applied Sciences, 2023 Online dynamic network visualization is imperative for real-time network monitoring and analysis applications. It presents a significant research challenge for maintaining both layout stability and quality amid unpredictable temporal changes.
Guijuan Wang +6 more
doaj +1 more source
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
Graph Transformer GANs With Graph Masked Modeling for Architectural Layout Generation [PDF]
IEEE Transactions on Pattern Analysis and Machine IntelligenceWe present a novel graph Transformer generative adversarial network (GTGAN) to learn effective graph node relations in an end-to-end fashion for challenging graph-constrained architectural layout generation tasks.
Hao Tang +3 more
semanticscholar +1 more source
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
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
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