# Efficient , High-Quality Force-Directed Graph Drawing

@inproceedings{Hu2005EfficientH, title={Efficient , High-Quality Force-Directed Graph Drawing}, author={Yifan Hu}, year={2005} }

- Published 2005

We propose a graph drawing algorithm that is both efficient and high quality. This algorithm combines a multilevel approach, which effectively overcomes local minimums, with the Barnes and Hut [1] octree technique, which approximates shortand long-range force efficiently. Our numerical results show that the algorithm is comparable in speed to Walshaw’s [2] highly efficient multilevel graph drawing algorithm, yet gives better results on some of the difficult problems. In addition, an adaptive… CONTINUE READING

#### Citations

##### Publications citing this paper.

Showing 1-10 of 122 extracted citations

## A Scalability and Sensitivity Study of Parallel Geometric Algorithms for Graph Partitioning

View 7 Excerpts

Highly Influenced

## Scalable parallel graph partitioning

View 5 Excerpts

Highly Influenced

## An Efficient Two-Phase Model for Computing Influential Nodes in Social Networks Using Social Actions

View 2 Excerpts

Highly Influenced

## Graph Drawing by Stochastic Gradient Descent.

View 4 Excerpts

Highly Influenced

## A study into data analysis and visualisation to increase the cyber-resilience of healthcare infrastructures

View 3 Excerpts

Highly Influenced

## Empirical Comparison of Visualization Tools for Larger-Scale Network Analysis

View 4 Excerpts

Highly Influenced

## Vertex-neighboring multilevel force-directed graph drawing

View 6 Excerpts

Highly Influenced

## Storing and Analyzing Social Data University of Basel Computer

View 3 Excerpts

Highly Influenced

## Scalable Force Directed Graph Layout Algorithms Using Fast Multipole Methods

View 6 Excerpts

Highly Influenced

## Toward the Design of a Recommender System: Visual Clustering and Detecting Community Structure in a Web Usage Network

View 5 Excerpts

Highly Influenced

#### Citation Statistics

#### 204 Citations

Citations per Year

Semantic Scholar estimates that this publication has

**204**citations based on the available data.See our **FAQ** for additional information.

#### References

##### Publications referenced by this paper.

Showing 1-10 of 33 references

## A hierarchical O(N log N) force-calculation algorithm

View 13 Excerpts

Highly Influenced

## A Multilevel Algorithm for Force-Directed Graph-Drawing

View 10 Excerpts

Highly Influenced

## Reigold, “Graph Drawing by Force-Directed Placement,

View 9 Excerpts

Highly Influenced

## An Algorithm for Drawing General Undirected Graphs

View 7 Excerpts

Highly Influenced

## A multi-scale algorithm for drawing graphs nicely

View 7 Excerpts

Highly Influenced

## Large Scale Relational Information Visualization

View 10 Excerpts

Highly Influenced

## A Fast Multi-scale Method for Drawing Large Graphs

View 5 Excerpts

Highly Influenced

## A Numerical Optimization Approach to General Graph Drawing

View 6 Excerpts

Highly Influenced

## Fade: Graph Drawing

View 6 Excerpts

Highly Influenced