GEOMI: GEOmetry for maximum insight

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3843 LNCS, Issue , 2006, Pages 468-479

  Ahmed, Adel ^a,b   Dwyer, Tim ^c   Forster, Michael ^a   Fu, Xiaoyan ^a   Ho, Joshua ^b   Hong, Seok Hee ^a,b   Koschützki, Dirk ^e   Murray, Colin ^a,b   Nikolov, Nikola S ^a,d   Taib, Ronnie ^a   Tarassov, Alexandre ^a,d   Xu, Kai ^a  

^a CSIRO   (Australia)

^b UNIVERSITY OF SYDNEY   (Australia)

^c MONASH UNIVERSITY   (Australia)

^d UNIVERSITY OF LIMERICK   (Ireland)

^e LEIBNIZ INSTITUTE OF PLANT GENETICS AND CROP PLANT RESEARCH IPK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ELECTRIC NETWORK ANALYSIS; GRAPH THEORY; INTERACTIVE COMPUTER GRAPHICS; NAVIGATION SYSTEMS;

GRAPH LAYOUT ALGORITHMS; GRAPH NAVIGATION; INTERACTION METHODS; VISUALISATION TECHNIQUES;

COMPUTATIONAL GEOMETRY;

EID: 33745655006     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11618058_42     Document Type: Conference Paper

References (12)

1. Dwyer, T.: Extending the WilmaScope 3D graph visuzlisation system - software demonstration. In: In Proceeding of Asia-Pacific Symposium on Information Visualisation 2005 (APVIS2005). (2005) 35-42
2. Madadhain, J.O., Fisher, D., Smyth, P., White, S., Boey, Y.B.: Analysis and visualization of network data using JUNG, http://jung.sourceforge.net (2005)
3. Dwyer, T., Hong, S.H., Koschützki, D., Schreiber, F., Xu, K.: Visual analysis of network centralities. In: Planed submission for APvis 2006. (2005)
4. Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge Univ. Press (1994)
5. Hong, S.H., Nikolov, N.S.: Hierarchical layouts of directed graphs in three dimensions. Technical report, National ICT Australia Ltd. (NICTA) (2005)
6. Nikolov, N., Tarassov, A.: Graph layering by promotion of nodes. Special issue of Discrete Applied Mathematics associated with the IV ALIO/EURO Workshop on Applied Combinatorial Optimization (to appear)
7. Tarassov, A., Nikolov, N.S., Branke, J.: A heuristic for minimum-width of graph layering with consideration of dummy nodes. In: Experimental and Efficient Algorithms, Third International Workshop. Lecture Notes in Computer Science, Springer-Verlag (2004) 570-583
8. Hong, S.H., Nikolov, N.S.: Layered drawings of directed graphs in three dimensions. In: Information Visualisation 2005: Asia-Pacific Symposium on Information Visualisation (APVIS2005), CRPIT (2005) 69-74
9. Brandes, U., Köpf, B.: Fast and simple horizontal coordinate assignment. In Mutzel, P., Jünger, M., S., L., eds.: Graph Drawing: Proceedings of 9th International Symposium, GD 2001. Volume 2265 of Lecture Notes in Computer Science., Springer-Verlag (2002) 31-44
10. Ho, J., Hong, S.H.: Drawing clustered graphs in three dimensions, to appear in the proceedings of 13th International Symposium on Graph Drawing (GD2005) (2005)
11. Baur, M., Brandes, U.: Crossing reduction in circular layouts. In: Proceedings on 30th International Workshop Graph-Theorectic Concepts in Computer Sciecne. (2004) 332-343
12. Ahmed, A., Dwyer, T., Hong, S.U., Murray, C., Song, L., Wu, Y.X.: Visualisation and analysis of large and complex scale-free networks. In: in Proceedings Eurographics / IEEE VGTC Symposium on Visualization (EuroVis 2005). (2005) to appear