Visualizing Software for Telecommunication Services

Proceedings of ACM Symposium on Software Visualization

Volumn , Issue , 2003, Pages 151-157

  Gansner, Emden R ^a   Mocenigo, John M ^a   North, Stephen C ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

Algorithm animation; Graph layout

Indexed keywords

ALGORITHMS; ANIMATION; COMPUTER ARCHITECTURE; COMPUTER SOFTWARE; GRAPHICAL USER INTERFACES;

INSTANT MESSAGING;

TELECOMMUNICATION SERVICES;

EID: 0141998618     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/774833.774855     Document Type: Conference Paper

References (34)

1. BIEDL, T. C., AND KAUFMANN, M. 1997. Area-efficient static and incremental graph drawings. In European Symposium on Algorithms, 37-52.
2. BRANDES, U., AND WAGNER, D. 1998. Dynamic grid embedding with few bends and changes. In ISAAC: 9th International Symposium on Algorithms and Computation.
3. BRANDES, U., KENIS, P., AND WAGNER, D. 1999. Generality in policy network drawings. In Proc. Symp. Graph Drawing GD'99, Springer-Verlag, Berlin, J. Kratochvíl, Ed., vol. 1731 of Lecture Notes in Computer Science, 250-258.
4. DAVIDSON, R., AND HAREL, D. 1996. Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics 15, 4, 301-331.
5. DENGLER, E., FRIEDELL, M., AND MARKS, J. 1993. Constraintdriven diagram layout. In Proc. IEEE Symp. Visual Languages, 330-335.
6. DIEHL, S., AND GÖRG, C. 2002. Graphs, they are changing - dynamic graph drawing for a sequence of graphs. In Proc. Symp. Graph Drawing GD'02, S. G. Kobourov and M. T. Goodrich, Eds., vol. 2528 of Lecture Notes in Computer Science, 23-30.
7. DODSON, D. 1995. Comaide: Information visualization using cooperative 3d diagram layout. In Proc. Symp. Graph Drawing GD'95, Springer-Verlag, Berlin, F. Brandenburg, Ed., vol. 1027 of Lecture Notes in Computer Science, 190-201.
8. DOSTRY, D. I. 1996. Some three-dimensional graph drawing algorithms. Master's thesis, U. Newcastle.
9. EADES, P. 1984. A heuristic for graph drawing. Congressus Numerantium 42, 149-160.
10. FRICK, A., LUDWIG, A., AND MEHLDAU, H. 1995. A fast adaptive layout algorithm for undirected graphs. In Proc. Symp. Graph Drawing GD'94, R. Tamassia and I. Tollis, Eds., vol. 894 of Lecture Notes in Computer Science, 388-403.
11. FRICK, A., KESKIN, C., AND VOGELMANN, V. 1996. Integration of declarative approaches. In Proc. Symp. Graph Drawing GD'96, S. North, Ed., vol. 1190 of Lecture Notes in Computer Science, 184-192.
12. FRIEDRICH, C., AND HOULE, M. E. 2002. Graph drawing in motion II. In Proc. Symp. Graph Drawing GD'01, P. M. et al., Ed., vol. 2265 of Lecture Notes in Computer Science, 220-231.
13. FRUCHTERMAN, T., AND REINGOLD, E. 1991. Graph drawing by force-directed placement. Software - Practice and Experience 21, 11, 1129-1164. also as Technical Report UIUCDCS-R-90-1609, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, 1990.
14. FRUCHTERMAN, T., AND REINGOLD, E. 1991. Graph drawing by force-directed placement. Software - Practice and Experience 21, 11, 1129-1164. also as Technical Report UIUCDCS-R-90-1609, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, 1990.
15. GANSNER, E., AND NORTH, S. 1999. Improved force-directed layouts. In Proc. Symp. Graph Drawing GD'98, Springer-Verlag, Montreal, Canada, S. Whitesides, Ed., vol. 1547 of Lecture Notes in Computer Science, 364-373.
16. GANSNER, E. R., KOUTSOFIOS, E., NORTH, S. C., AND Vo, K.-P. 1993. A technique for drawing directed graphs. IEEE Trans. Software Engineering 19, 3, 214-230.
17. HAREL, D., AND KOREN, Y. 2002. Drawing graphs with nonuniform vertices. In Proc. Working Conf. Advanced Visual Interfaces AVI'02, 157-166.
18. HE, W., AND MARRIOTT, K. 1997. Constrained graph layout. In Proc. Symp. Graph Drawing GD'96, S. North, Ed., vol. 1190 of Lecture Notes in Computer Science, 217-232.
19. HUANG, M. L., EADES, P., AND WANG, J. 1998. On-line animated visualization of huge graphs using a modified spring algorithm. Journal of Visual Languages and Computing 9, 6 (Dec.), 623-645.
20. JACKSON, M., AND ZAVE, P. 1998. Distributed feature composition: A virtual architecture for telecommunications services. IEEE Trans. Software Engineering 24, 10 (Oct.), 831-847.
21. KAMADA, T., AND KAWAI, S. 1989. An algorithm for drawing general undirected graphs. Information Processing Letters 31, 1 (Apr.), 7-15.
22. KAMPS, T., KLEINZ, J., AND READ, J. 1996. Constraint-based spring-model algorithm for graph layout. In Proc. Symp. Graph Drawing GD'95, F. Brandenburg, Ed., vol. 1027 of Lecture Notes in Computer Science, 349-360.
23. KISIELEWICZ, S. M. H. A., AND RIVAL, I. 1995. Upward drawings on planes and spheres. In Proc. Symp. Graph Drawing GD'95, Springer-Verlag, Berlin, F. Brandenburg, Ed., vol. 1027 of Lecture Notes in Computer Science, 277-286.
24. KRATOCHVIL, J., AND PRZYTYCKA, T. 1995. Grid intersection and box intersection graphs on surfaces. In Proc. Symp. Graph Drawing GD'95, Springer-Verlag, Berlin, F. Brandenburg, Ed., vol. 1027 of Lecture Notes in Computer Science, 365-372.
25. KRUSKAL, J., AND SEERY, J. 1980. Designing network diagrams. In Proc. First General Conf. on Social Graphics, 22-50.
26. LEE, W., BARGHOUTI, N., AND MOCENIGO, J. 1997. Grappa: A graph package in Java. In Proc. Symp. Graph Drawing GD'97.
27. MISUE, K., EADES, P., LAI, W., AND SUGIYAMA, K. 1995. Layout adjustment and the mental map. J. Visual Languages and Computing 6, 2, 183-210.
28. NORTH, S. C., AND WOODHULL, G. C. M. 2002. Online hierarchical graph drawing. In Proc. Symp, Graph Drawing GD'01, P. M. et al., Ed., vol. 2265 of Lecture Notes in Computer Science, 232-246.
29. SHIEH, F.-S., AND McCREARY, C. L. 2000. Clan-based incremental drawing. In Proc. Symp. Graph Drawing GD'00, J. Marks, Ed., vol. 1984 of Lecture Notes in Computer Science, 384-395.
30. SUGIYAMA, K., AND MISUE, K. 1995. A simple and unified method for drawing graphs: Magnetic-spring algorithm. In Proc. Symp. Graph Drawing GD'94, R. Tamassia and I. Tollis, Eds., vol. 894 of Lecture Notes in Computer Science, 364-375.
31. SUGIYAMA, K., TAGAWA, S., AND TODA, M. 1981. Methods for visual understanding of hierarchical systems. IEEE Trans. Systems, Man and Cybernetics SMC-11, 2, 109-125.
32. TAMASSIA, R., AND TOLLIS, I. G. 1991. Representations of graphs on a cylinder. SIAM J. Disc. Math. 4, 1 (Feb.), 139-149.
33. TOLLIS, I., AND XIA, C. 1995. Drawing telecommunications networks. In Proc. Symp. Graph Drawing GD'94, R. Tamassia and I. Tollis, Eds., vol. 894 of Lecture Notes in Computer Science, 206-217.
34. ZAVE, P., AND ET AL., C. R., 2002. The Building Box Project. www.research.art.com/projects/ buildingbox, www.research.att.com/projects/ eclipse.