Results 11 to 20 of about 1,421,171 (369)
Interactive Graph Layout of a Million Nodes
Informatics, 2016 Sensemaking of large graphs, specifically those with millions of nodes, is a crucial task in many fields. Automatic graph layout algorithms, augmented with real-time human-in-the-loop interaction, can potentially support sensemaking of large graphs ...
Peng Mi +4 more
doaj +2 more sources
A Regularized Graph Layout Framework for Dynamic Network Visualization
Data mining and knowledge discovery, 2013 Many real-world networks, including social and information networks, are dynamic structures that evolve over time. Such dynamic networks are typically visualized using a sequence of static graph layouts.
AE Hoerl +38 more
core +2 more sources
Six methods for transforming layered hypergraphs to apply layered graph layout algorithms
Computer graphics forum (Print), 2022 Hypergraphs are a generalization of graphs in which edges (hyperedges) can connect more than two vertices—as opposed to ordinary graphs where edges involve only two vertices. Hypergraphs are a fairly common data structure but there is little consensus on
Sara Di Bartolomeo +5 more
openalex +3 more sources
An Empirical Evaluation of Force-Directed Graph Layout
, 2014 Force-directed graph layout is a widely used algorithm for the automatic layout of graphs. Little experimental work has been done exploring the behaviour of the algorithm under a variety of conditions.
Roman Klapaukh
openalex +3 more sources
Large graph layout optimization based on vision and computational efficiency: a survey
Visual Intelligence, 2023 Graph layout can help users explore graph data intuitively. However, when handling large graph data volumes, the high time complexity of the layout algorithm and the overlap of visual elements usually lead to a significant decrease in analysis efficiency
Shuhang Zhang, Ruihong Xu, Yining Quan
semanticscholar +1 more source
Optimizing graph layout by t-SNE perplexity estimation
International Journal of Data Science and Analysis, 2022 Perplexity is one of the key parameters of dimensionality reduction algorithm of t-distributed stochastic neighbor embedding (t-SNE). In this paper, we investigated the relationship of t-SNE perplexity and graph layout evaluation metrics including graph ...
Chun Xiao, Seokhee Hong, Weidong Huang
semanticscholar +1 more source
DRGraph: An Efficient Graph Layout Algorithm for Large-scale Graphs by Dimensionality Reduction [PDF]
IEEE Transactions on Visualization and Computer Graphics, 2020 Efficient layout of large-scale graphs remains a challenging problem: the force-directed and dimensionality reduction-based methods suffer from high overhead for graph distance and gradient computation.
Minfeng Zhu +5 more
semanticscholar +1 more source
Taurus: Towards a Unified Force Representation and Universal Solver for Graph Layout
IEEE Transactions on Visualization and Computer Graphics, 2022 Over the past few decades, a large number of graph layout techniques have been proposed for visualizing graphs from various domains. In this paper, we present a general framework, Taurus, for unifying popular techniques such as the spring-electrical ...
Mingliang Xue +6 more
semanticscholar +1 more source
Doc-GCN: Heterogeneous Graph Convolutional Networks for Document Layout Analysis [PDF]
International Conference on Computational Linguistics, 2022 Recognizing the layout of unstructured digital documents is crucial when parsing the documents into the structured, machine-readable format for downstream applications.
Siwen Luo +4 more
semanticscholar +1 more source
Linear Layouts of Complete Graphs [PDF]
, 2021 Appears in the Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021)
Felsner, S. +3 more
openaire +3 more sources