Results 21 to 30 of about 29,184 (301)
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.
Dana Vrajitoru, Jason DeBoni
openaire +1 more source
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.
Moritz Klammler +2 more
openaire +4 more sources
Rectangular layouts and contact graphs [PDF]
ACM Transactions on Algorithms, 2008 Contact graphs of isothetic rectangles unify many concepts from applications including VLSI and architectural design, computational geometry, and GIS. Minimizing the area of their corresponding rectangular layouts is a key problem.
Adam L. Buchsbaum +3 more
openaire +2 more sources
A survey of two-dimensional graph layout techniques for information visualisation [PDF]
, 2012 Many algorithms for graph layout have been devised over the last 30 years spanning both the graph drawing and information visualisation communities. This article first reviews the advances made in the field of graph drawing that have then often been ...
Vickers, Paul, Gibson, Helen, Faith, Joe
core +1 more source
A Tabu Search Based Approach for Graph Layout [PDF]
, 2014 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.
Rodgers, Peter, Dib, Fadi
core +1 more source
Chic. J. Theor. Comput. Sci., 2015 Bourgain and Yehudayoff recently constructed $O(1)$-monotone bipartite expanders. By combining this result with a generalisation of the unraveling method of Kannan, we construct 3-monotone bipartite expanders, which is best possible. We then show that the same graphs admit 3-page book embeddings, 2-queue layouts, 4-track layouts, and have simple ...
Vida Dujmovic +2 more
openaire +4 more sources
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.
Johannes F. Kruiger +5 more
openaire +3 more sources
A Graph Layout Framework Combining t-Distributed Neighbor Retrieval Visualizer and Energy Models
IEEE Access, 2019 Graph layout investigates the structure of the graph in order to better obtain the information implied in the graph. To solve the shortcomings of dimension reduction layouts on local adjustment and the insufficiency of energy models to maintain the ...
Guangluan Xu +6 more
doaj +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
Layout Metrics for Euler Diagrams [PDF]
, 2003 We present an aesthetics based method for drawing Euler diagrams. Aesthetic layout metrics have been found to be useful in graph drawing algorithms, which use metrics motivated by aesthetic principles that aid user understanding of diagrams.
Flower, J., Rodgers, P., Mutton, P.
core +1 more source