A multilevel algorithm for force-directed graph drawing

DOI10.1007/3-540-44541-2_17MaRDI QIDQ4472305zbMATH OpenFDO

Authors C. Walshaw

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1984/19840171.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A Multilevel Algorithm for Force-Directed Graph-Drawing
• A multi-dimensional approach to force-directed layouts of large graphs
• A multi-dimensional approach to force-directed layouts of large graphs
• Graph Drawing
• A Fast Multi-Scale Method for Drawing Large Graphs

Cited in

(40)

• A force-directed algorithm that preserves edge-crossing properties
• Faster force-directed graph drawing with the well-separated pair decomposition
• A multi-dimensional approach to force-directed layouts of large graphs
• A graph-based N-body approximation with application to stochastic neighbor embedding
• Drawing large graphs by multilevel maxent-stress optimization
• Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition
• A distributed multilevel force-directed algorithm
• scientific article; zbMATH DE number 2084291 (Why is no real title available?)
• An experimental evaluation of multilevel layout methods
• Hybrid layout algorithm based on skeleton subgraph
• Graph drawing for floorplanning with flexible blocks
• Multipole-Based Force Approximation Revisited – A Simple but Fast Implementation Using a Dynamized Enclosing-Circle-Enhanced k-d-Tree
• Integrating Edge Routing into Force-Directed Layout
• Rapid Multipole Graph Drawing on the GPU
• The Binary Stress Model for Graph Drawing
• A fast successive over-relaxation algorithm for force-directed network graph drawing
• A Fast Multi-Scale Method for Drawing Large Graphs
• scientific article; zbMATH DE number 1990778 (Why is no real title available?)
• Drawing Huge Graphs by Algebraic Multigrid Optimization
• scientific article; zbMATH DE number 2069509 (Why is no real title available?)
• Drawing hypergraphs in the subset standard
• A fast multi-scale method for drawing large graphs
• FADE: Graph drawing, clustering, and visual abstraction
• A multi-dimensional approach to force-directed layouts of large graphs
• GRIP: Graph drawing with intelligent placement
• A fast layout algorithm for k-level graphs
• Navigating Clustered Graphs Using Force-Directed Methods
• A Multilevel Algorithm for Force-Directed Graph-Drawing
• Force-directed graph drawing using social gravity and scaling
• Multilevel graph embedding
• Graph reduction with spectral and cut guarantees
• An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing
• Multi-circular Layout of Micro/Macro Graphs
• Graph Drawing
• Graph Drawing
• Graph Drawing
• A multi-scale algorithm for drawing graphs nicely
• Drawing power law graphs using a local/global decomposition
• Fast layout computation of clustered networks: algorithmic advances and experimental analysis
• A comparison of problem decomposition techniques for the FAP

This page was built for publication: A multilevel algorithm for force-directed graph drawing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472305)