Pages that link to "Item:Q1822997"
From MaRDI portal
The following pages link to An algorithm for drawing general undirected graphs (Q1822997):
Displaying 43 items.
- Challenger, a New Way to Visualize Data (Q3223989) (← links)
- Drawing weighted directed graph from it’s adjacency matrix (Q3368131) (← links)
- Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes (Q3378514) (← links)
- SELF-ORGANIZATION APPLIED TO DYNAMIC NETWORK LAYOUT (Q3500260) (← links)
- Network Dynamics when Selecting Work Team Members (Q3606088) (← links)
- Rapid Multipole Graph Drawing on the GPU (Q3611842) (← links)
- The Binary Stress Model for Graph Drawing (Q3611852) (← links)
- Efficient Node Overlap Removal Using a Proximity Stress Model (Q3611853) (← links)
- An Experimental Study on Distance-Based Graph Drawing (Q3611854) (← links)
- Topology Preserving Constrained Graph Layout (Q3611855) (← links)
- The k-Dense Method to Extract Communities from Complex Networks (Q3627917) (← links)
- How to draw a directed graph (Q3985344) (← links)
- Evolutionary graph drawing algorithms (Q4454480) (← links)
- An Experimental Study on the Ply Number of Straight-line Drawings (Q4622771) (← links)
- Anisotropic Radial Layout for Visualizing Centrality and Structure in Graphs (Q4625124) (← links)
- Community Detection in Networks via Nonlinear Modularity Eigenvectors (Q4683908) (← links)
- Experimental studies on graph drawing algorithms (Q4789076) (← links)
- Review of statistical network analysis: models, algorithms, and software (Q4969842) (← links)
- Summarizing and understanding large graphs (Q4970005) (← links)
- Graph Drawing via Gradient Descent, $$(GD)^2$$ (Q5014098) (← links)
- Stochastic Gradient Descent Works Really Well for Stress Minimization (Q5014101) (← links)
- The Turing Test for Graph Drawing Algorithms (Q5014138) (← links)
- Digital archives as Big data (Q5034271) (← links)
- Aesthetic Discrimination of Graph Layouts (Q5233134) (← links)
- Using a Significant Spanning Tree to Draw a Directed Graph (Q5301439) (← links)
- Core-Periphery Structure in Networks (Revisited) (Q5348331) (← links)
- Constrained Stress Majorization Using Diagonally Scaled Gradient Projection (Q5452226) (← links)
- Graph Drawing (Q5711602) (← links)
- Graph Drawing (Q5711603) (← links)
- Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers (Q5886342) (← links)
- Generalizing geometric graphs (Q5891389) (← links)
- Graph Drawing (Q5896911) (← links)
- Graph Drawing (Q5896914) (← links)
- A multi-scale algorithm for drawing graphs nicely (Q5948958) (← links)
- Optimization of mixture models on time series networks encoded by visibility graphs: an analysis of the US electricity market (Q6088799) (← links)
- Spherical graph drawing by multi-dimensional scaling (Q6117037) (← links)
- Detecting causal relations in time series with the new cross Markov matrix technique (Q6174226) (← links)
- Graph grammar formalism with multigranularity for spatial graphs (Q6190086) (← links)
- Detecting opinion-based groups and polarization in survey-based attitude networks and estimating question relevance (Q6497567) (← links)
- Balancing between the local and global structures (LGS) in graph embedding (Q6560154) (← links)
- The appeals of quadratic majorization-minimization (Q6568947) (← links)
- Minimum partition into plane subgraphs: the CG:SHOP challenge 2022 (Q6579770) (← links)
- Visualizing large graphs (Q6604447) (← links)
