An algorithm for drawing general undirected graphs
From MaRDI portal
Publication:1822997
DOI10.1016/0020-0190(89)90102-6zbMath0679.68128OpenAlexW2075220720WikidataQ56428731 ScholiaQ56428731MaRDI QIDQ1822997
Publication date: 1989
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(89)90102-6
Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99) Data structures (68P05)
Related Items
Digital archives as Big data, Complex systems: features, similarity and connectivity, Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers, Online force-directed algorithms for visualization of dynamic graphs, Self-organizing maps for drawing large graphs, Metric graphs elastically embeddable in the plane, A review of theory and practice in scientometrics, HYPERSOLVER: A graphical tool for commonsense set theory, Deep neural network for drawing networks, \({(DNN)^{ 2 }} \), RECURRENCE NETWORKS: EVOLUTION AND ROBUSTNESS, Visualizing the effects of a changing distance on data using continuous embeddings, Topological relationships between brain and social networks, A graph theoretic framework for representation, exploration and analysis on computed states of physical systems, Aspects of topology, genus and isomerism in closed 3-valent networks, Renotation from Optical Music Recognition, Explosive percolation in the human protein homology network, Parameterisation of Keeling's network generation algorithm, A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing, Challenger, a New Way to Visualize Data, An improved force-directed graph layout algorithm based on aesthetic criteria, Core-Periphery Structure in Networks (Revisited), SELF-ORGANIZATION APPLIED TO DYNAMIC NETWORK LAYOUT, Optimization of mixture models on time series networks encoded by visibility graphs: an analysis of the US electricity market, FORBID: Fast Overlap Removal By stochastic gradIent Descent for graph drawing, Spherical graph drawing by multi-dimensional scaling, Modelling structured societies: a multi-relational approach to context permeability, Detecting causal relations in time series with the new cross Markov matrix technique, Graph grammar formalism with multigranularity for spatial graphs, A fast successive over-relaxation algorithm for force-directed network graph drawing, Multi-level graph drawing using infomap clustering, Stress-Plus-X (SPX) graph layout, From simulated annealing to stochastic continuation: a new trend in combinatorial optimization, An Experimental Study on the Ply Number of Straight-Line Drawings, An Experimental Study on the Ply Number of Straight-line Drawings, A force-directed algorithm for drawing directed graphs symmetrically, Anisotropic Radial Layout for Visualizing Centrality and Structure in Graphs, A regularized graph layout framework for dynamic network visualization, Aesthetic discrimination of graph layouts, Data-driven graph drawing techniques with applications for conveyor systems, Unnamed Item, Visualizing network communities with a semi-definite programming method, Layer communities in multiplex networks, An experimental comparison of four graph drawing algorithms., Global and robust formation-shape stabilization of relative sensing networks, A multi-scale algorithm for drawing graphs nicely, Self-organized topology of recurrence-based complex networks, Navigation in spatial networks: a survey, Network congestion analysis of gravity generated models, Community Detection in Networks via Nonlinear Modularity Eigenvectors, Network Dynamics when Selecting Work Team Members, Topological aspects of the multi-language phases of the naming game on community-based networks, Rapid Multipole Graph Drawing on the GPU, The Binary Stress Model for Graph Drawing, Efficient Node Overlap Removal Using a Proximity Stress Model, An Experimental Study on Distance-Based Graph Drawing, Topology Preserving Constrained Graph Layout, Constrained Stress Majorization Using Diagonally Scaled Gradient Projection, Characterizing pseudoperiodic time series through the complex network approach, Constrained graph layout by stress majorization and gradient projection, The k-Dense Method to Extract Communities from Complex Networks, Review of statistical network analysis: models, algorithms, and software, Summarizing and understanding large graphs, Evolutionary graph drawing algorithms, \(H^1\)-parametrizations of complex planar physical domains in isogeometric analysis, Aesthetic Discrimination of Graph Layouts, Graph layout for applications in compiler construction, Interactive unsupervised classification and visualization for browsing an image collection, Spring algorithms and symmetry, An effective crossing minimisation heuristic based on star insertion, One-dimensional layout optimization, with applications to graph drawing by axis separation, Graph Drawing via Gradient Descent, $$(GD)^2$$, Stochastic Gradient Descent Works Really Well for Stress Minimization, The Turing Test for Graph Drawing Algorithms, Graph multidimensional scaling with self-organizing maps, A force-directed algorithm that preserves edge-crossing properties
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A fast backtrack algorithm for graph isomorphism
- Algorithms for drawing graphs: An annotated bibliography
- A V log V algorithm for isomorphism of triconnected planar graphs
- On the Optimal Layout of Planar Graphs with Fixed Boundary
- Crossing Theory and Hierarchy Mapping
- An Efficient Algorithm for Graph Isomorphism
- A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time $O(n^2 \log ^2 n)$
- How to Draw a Graph
