Efficient , High-Quality Force-Directed Graph Drawing

@inproceedings{Hu2005EfficientH,
  title={Efficient , High-Quality Force-Directed Graph Drawing},
  author={Yifan Hu},
  year={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
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 203 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 122 extracted citations

Scalable parallel graph partitioning

2013 SC - International Conference for High Performance Computing, Networking, Storage and Analysis (SC) • 2013
View 5 Excerpts
Highly Influenced

Graph Drawing by Stochastic Gradient Descent.

IEEE transactions on visualization and computer graphics • 2018
View 4 Excerpts
Highly Influenced

Vertex-neighboring multilevel force-directed graph drawing

2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC) • 2016
View 6 Excerpts
Highly Influenced

Scalable Force Directed Graph Layout Algorithms Using Fast Multipole Methods

2012 11th International Symposium on Parallel and Distributed Computing • 2012
View 6 Excerpts
Highly Influenced

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

2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology • 2012
View 5 Excerpts
Highly Influenced

204 Citations

02040'10'12'14'16'18
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

Nature • 1986
View 13 Excerpts
Highly Influenced

A Multilevel Algorithm for Force-Directed Graph-Drawing

J. Graph Algorithms Appl. • 2000
View 10 Excerpts
Highly Influenced

Reigold, “Graph Drawing by Force-Directed Placement,

E.M.T.M.J. Fruchterman
Software—Practice and Experience, • 1991
View 9 Excerpts
Highly Influenced

An Algorithm for Drawing General Undirected Graphs

Inf. Process. Lett. • 1989
View 7 Excerpts
Highly Influenced

A multi-scale algorithm for drawing graphs nicely

Discrete Applied Mathematics • 2001
View 7 Excerpts
Highly Influenced

Large Scale Relational Information Visualization

A. Quigley
Clustering, and Abstraction,” Ph.D. thesis, Department of Computer Science and Software Engineering, University of Newcastle, Australia • 2001
View 10 Excerpts
Highly Influenced

A Fast Multi-scale Method for Drawing Large Graphs

Graph Drawing • 2000
View 5 Excerpts
Highly Influenced

Fade: Graph Drawing

A. Quigley, P. Eades
Clustering, and Visual Abstraction,” Lecture Notes in Computer Science • 1984
View 6 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…