Visualization of clustered directed acyclic graphs with node interleaving

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2009, Pages 1800-1805

  Kumar, Pushpa ^a   Zhang, Kang ^a  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

Directed acyclic graphs; Graph drawing; Node interleaving; Overlapping nodes; Visualization

Indexed keywords

AREA REDUCTION; AVERAGE DISTANCE; BUYER-SELLER RELATIONSHIPS; DIRECTED ACYCLIC GRAPHS; DRAWING PROCESS; EQUILIBRIUM DISTANCES; GRAPH DRAWING; GRAPHS AND NETWORKS; REPULSIVE FORCES; SPRING ALGORITHMS; STABLE STATE; STRUCTURAL INFORMATION; UPPER BOUND;

COMPUTER SCIENCE; DRAWING (GRAPHICS);

VISUALIZATION;

EID: 70350062294     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1529282.1529685     Document Type: Conference Paper

References (27)

1. Purchase, H. C., Cohen, R. F., and James, M. Validating Graph Drawing Aesthetics. In Proceedings of the Symposium on Graph Drawing (GD '95) (Passau, Germany, September 20-22, 1995). Springer-Verlag London, UK, 1995, 435-446.
2. Kaufmann, M., and Dorothea, W. Drawing graphs, methods and models. Springer-Verlag, 2001.
3. Battista, G.D., Eades, P., Tamassia, R., and Tollis, I.G. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999.
4. Li, W., Eades, P., and Nikolov, N. Using spring algorithms to remove node overlapping. In Proceedings of the 2005 Asia-Pacific symposium on Information visualization (APVIS '05) (Sydney, Australia, January 27-29, 2005). Australian Computer Society Inc., Darlinghurst, Australia, 2005, 131-140.
5. Quigley, A., and Eades, P. FADE: Graph Drawing, Clustering, and Visual Abstraction. In Proceedings of the 8th International Symposium on Graph Drawing (GD '00) (Colonial Williamsburg, VA, USA, September 20-23, 2000). Springer-Verlag London, UK, 2000, 197-210.
6. Huang, X., Lai, W., Sajeev, A.S.M., and Gao J. A new algorithm for removing node overlapping in graph visualization. Information Sciences An International Journal, 177, 14 (July 2007), 2821-2844.
7. Eades, P., and L. Xuemin. Spring Algorithms and Symmetry. In Proceedings of the third International Conference on Computing and Combinatorics (COCOON '97) (Shanghai, China, August 20-22, 1997). Springer-Verlag London, UK, 1997, 202-211.
8. Kamada T., and Kawai, S. An algorithm for drawing general undirected graphs. Information Processing Letters, 31, 1 (April 1989), 7-15.
9. Kumar, P., Zhang, K., and Wang, Y. Visualization of Clustered Directed Acyclic Graphs without Node Overlapping. In Proceedings of the 12th International Conference on Information Visualization (IV '08) (London, UK, July 9-11 2008). IEEE Computer Society, Washington, DC, USA, 2008, 38-43.
10. Leymann F. Web Services Flow Language (WSFL 1.0), IBM, May 2001.
11. Korb, K. B., and Nicholson, A. E.. Bayesian Artificial Intelligence. Chapman & Hall, London, UK, 2004.
12. Eades P. A heuristic for graph drawing. Congressus Numerantium, 42 (1984), 149-160.
13. Taylor, M., and Rodgers, P. Applying Graphical Design Techniques to Graph Visualization. In Proceedings of the Ninth International Conference on Information Visualization (IV '05) (London, UK, 6-8 July 2005). IEEE Computer Society Washington, DC, USA, 2005, 651-656.
14. Nascimento, H.A.D., and Eades P. User Hints for map labeling. Journal of Visual Languages and Computing, 19, 1 (February 2008), 39-74.
15. Kumar, P., and Zhang, K. Social Network Analysis of Online Marketplaces. In Proceedings of IEEE InternationalConference on e-Business Engineering (ICEBE '07) (Hong Kong, China, 24-26 October 2007). IEEE Press, 2007, 363-367.
16. Lai, W. Layout Adjustment and Boundary Detection for a Diagram. In Proceedings of Computer Graphics International (CGI '01) (Hong Kong, China, 3-6 July 2001). IEEE Computer Society, Washington, DC, USA, 2001, 351-354.
17. Yeh, C., and Gu, Y.Y. Technique to minimise area overhead for delay driven clustering. IEE Proceedings of Computers and Digital Techniques, 142, 6 (November 1995), 401-406.
18. Herman, I., Marshall, S.M., and Melancon, G., Density Functions for Visual Attributes and Effective Partitioning in Graph Visualization. In Proceedings IEEE Symposium on Information Visualization (INFOVIS'00) (Salt Lake City, Utah, USA, 9-10 October 2000). IEEE Computer Society Washington, DC, USA, 2000, 49.
19. Lux, M., Klieber, W., and Granitzer, M. Caliph & Emir: Semantics in Multimedia Retrieval and Annotation.In Proceedings for the 19th International CODATA Conference The Information Society: New Horizons For Science (Berlin, Germany, 7-10 November 2004). International Council for Science : Committee on Data for Science and Technology, 2004, 3-7.
20. Efrat, A., Kobourov, S., Stepp, M., and Wenk, C. Growing fat graphs. In Proceedings of the eighteenth annual symposium on Computational geometry (SoCG '02) (Barcelona, Spain, June 5-7, 2002). ACM New York, NY, USA, 2002, 277-278.
21. Li, W., Eades, P., and Hong, S.H. Navigating software architectures with constant visual complexity. In Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC '05) (Dallas, Texas, USA, 21-24 September 2005). IEEE Press, 2005, 225-232.
22. Furnas, G.W. Generalized Fisheye Views. In Proceedings of Human Factors in Computing Systems (CHI'86) (Boston MA, April 1986). ACM Press, 1986, 16-23.
23. Eades, P., and Feng, Q.W. Multilevel Visualization of Clustered Graphs. In Proceedings of Symposium on Graph Drawing (GD '96) (Berkeley, California, USA, September 18-20). Springer-Verlag, Berlin, 1997, 101-112.
24. Herman, I., Marshall, M.S., and Melançon G. Graph Visualisation and Navigation in Information Visualization: A Survey. IEEE Transactions on Visualization and Computer Graphics, 6, 1 (Jan-Mar 2000), 24-43.
25. Eades, P., Lai, W., Misue, K., and Sugiyama, K. Layout adjustment and the mental map. Journal of Visual Languages & Computing, 6 (1995), 83-210.
26. URL: http://www.graphdrawing.org
27. URL: http://www.prefuse.org