Visualization of clustered directed acyclic graphs without node overlapping

Proceedings of the International Conference on Information Visualisation

Volumn , Issue , 2008, Pages 38-43

  Kumar, Pushpa ^a   Zhang, Kang ^a   Wang, Yuke ^a  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

Directed acyclic graphs; Electrostatic forces; Force directed; Visualization

Indexed keywords

DRAWING (GRAPHICS); INFORMATION ANALYSIS; SPRINGS (COMPONENTS); VISUALIZATION;

DIRECTED ACYCLIC GRAPHS; ELECTROSTATIC FORCES; FORCE DIRECTED; INTERNATIONAL CONFERENCES; REPULSIVE FORCES; VISUALISATION; VISUALIZATION OF GRAPHS;

GRAPH THEORY;

EID: 52049113181     PISSN: 10939547     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IV.2008.85     Document Type: Conference Paper

References (20)

1. David P. Dobkin, Alejo Hausner, Emden R. Gansner and Stephen C. North. Uncluttering Force-Directed Graph Layouts. In Proceedings of the Fifteenth Annual Symposium on Computational Geometry. ACM, 425-426. 1999.
2. T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters. 7-15. April 1989.
3. Josh Barnes and Piet Hut. A hierarchical O(N log N) force-calculation algorithm. Nature. 446-449. 1986.
4. AT Adai, SV Date, S Wieland, and EM Marcotte. LGL: creating a map of protein function with an algorithm for visualizing very large biological networks. Journal of Molecular Biology. 179-190. June 2004.
5. Arne Frick, Andreas Ludwig, and Heiko Mehldau. A Fast Adaptive Layout Algorithm for Undirected Graphs. Proceedings of the DIMACS International Workshop on Graph Drawing. 388-403. 1994.
6. Peter Eades. A heuristic for graph drawing. Congressus Numerantium. 149-160. 1984.
7. Xiaodi Huang, Wei Lai, A. S. M. Sajeev, and Junbin Gao. A new algorithm for removing node overlapping in graph visualization. Information Sciences An International Journal. Elsevier Science Inc, 2821-2844. July 2007.
8. Wanchun Li, Peter Eades, and Nikola Nikolov. Using spring algorithms to remove node overlapping. Proceedings of the Asia-Pacific Symposium on Information Visualisation (APVIS2005). Australian Computer Society Inc, 131-140. 2005.
9. Konstantinos G. Kakoulis and Ioannis G. Tollis. A unified approach to labeling graphical features. Proc. 14th Annual ACM Symp. Computational Geometry (SoCG'98). ACM, 347-356. June 1998.
10. Chun-Cheng Lin and Hsu-Chun Yen. A New Force-Directed Graph Drawing Method Based on Edge-Edge Repulsion. IV 2005. IEEE Computer Society, 329-334. July 2005.
11. Kim Marriott, Peter Stuckey, Vincent Tam, and Weiqing He. Removing Node Overlapping in Graph Layout Using Constrained Optimization. Journal Constraints. Kluwer Academic Publishers, 143-171. April 2003.
12. Mao Lin Huang, Peter Eades, and Junhu Wang. On-line Animated Visualization of Huge Graphs using a Modified Spring Algorithm. Journal of Visual Languages & Computing. 623-645. 1998.
13. Andreas Noack. Energy-Based Clustering of Graphs with Nonuniform Degrees. Graph Drawing. 309-320. 2005.
14. Xiaodi Huang and Wei Lai. Clustering Graphs for Visualization via Node Similarities. Journal of Visual Languages and Computing. 225-253. June 2006.
15. Missae Yamamoto, Gilberto Camara, and Luiz Antonio Nogueira Lorena. Fast Point-Feature Label Placement Algorithm for Real Time Screen Maps. GeoInformatica, 77-90. 2002.
16. Michael Kaufmann and Dorothea Wagner. Drawing graphs, methods and models. Springer-Verlag. 2001.
17. Jeffrey Heer, Stuart K. Card, and James A. Landay. Prefuse: A Toolkit for Interactive Information Visualization. Proceedings of the SIGCHI conference on Human factors in computing systems. 421-430. April 2005.
18. Peter Eades and Mao Lin Huang. Navigating Clustered Graphs using Force-Directed Methods. Journal of Graph Algorithms and Applications. 157-181. 2000.
19. Hugo A. D. do Nascimento and Peter Eades. User Hints for map labeling. Journal of Visual Languages and Computing. Australian Computer Society Inc, 39-74. 2003.
20. Wikipedia article on Directed Acyclic Graphs url: http://en.wikipedia. org/wiki/Directed_acyclic_graph