Automated visualization of process diagrams

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

Volumn 2265, Issue , 2002, Pages 45-59

  Six, Janet M ^a   Tollis, Ioannis G ^a  

^a The University of Texas at Dallas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED VISUALIZATION; LINEAR TIME; PROCESS DIAGRAM; SUB-PROBLEMS;

ARTIFICIAL INTELLIGENCE; COMPUTERS;

DRAWING (GRAPHICS);

EID: 84867468173     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45848-4_4     Document Type: Article

References (22)

1. T. H. Cormen, C. E. Leiserson and R. L. Rivest, Introduction to Algorithms, McGraw-Hill, 1990.
2. G. Di Battista, P. Eades, R. Tamassia and I. G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice-Hall, 1999.
3. P. Eades, X. Lin and W. F. Smyth, A Fast and Effective Heuristic for the Feedback Arc Set Problem, Information Processing Letters, 47, pp. 319-323, 1993.
4. P. Eades and X. Lin, A New Heuristic for the Feedback Arc Set Problem, Australian Jrnl. of Combinatorics, 12, pp. 15-26, 1995.
5. M. V. Farino, Flowcharting, Prentice-Hall, 1970.
6. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, 1979.
7. GRADE User Manual, Infologistik GmbH, 2000. Also available at http://www.gradetools.com.
8. U. I. Gupta, D. T. Lee and J. Y.-T. Leung, An Optimal Solution for the Channel Assignment Problem, IEEE Trans. Computers, C-28(11), pp.807-810, 1979.
9. A. Hashimoto and J. Stevens, Wire Routing by Optimizing Channel Assignment with Large Apertures, Proc. 8th ACM/IEEE Design Automation Workshop, pp. 155-169, 1971.
10. G. Isaak, Tournaments as Feedback Arc Sets, Electronic Jrnl. of Combinatorics, 2(1), #R20, 1995. Also available at http://www.combinatorics.org.
11. P. Kikusts and P. Rucevskis, Layout Algorithms of Graph-Like Diagrams for GRADE Windows Graphic Editors, Proc. of GD '95, LNCS 1027, Springer-Verlag, pp. 361-364, 1996.
12. D. E. Knuth, Computer Drawn Flowcharts, Comm. of the ACM, 6(9), 1963.
13. A. S. La Paugh, Algorithms for Integrated Circuit Layout: An Analytic Approach, PhD Thesis, Massachusettes, 1980.
14. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, John Wiley and Sons, 1990.
15. J. Martin and C. McClure, Diagramming Techniques for Analysts and Programmers, Prentice-Hall, 1985.
16. A. Papakostas, Information Visualization: Orthogonal Drawings of Graphs, Ph.D. Thesis, The University of Texas at Dallas, 1996.
17. K. Ryall, J. Marks, and S. Shieber, An Interactive System for Drawing Graphs, Proc. GD '96, LNCS 1190, Springer-Verlag, pp. 387-94, 1997.
18. G. Sander, A Fast Heuristic for Hierarchical Manhattan Layout, Proc. GD '95, vol 1027 of LNCS, pp. 447-458, Springer-Verlag, 1996.
19. J. M. Six, VisTool: A Tool For Visualizing Graphs, Ph.D. Thesis, The University of Texas at Dallas, 2000.
20. K. Sugiyama, S. Tagawa and M. Toda, Methods for Visual Understanding of Hierarchical Systems, IEEE Trans. Systems, Man and Cybernetics, SMC-11, no. 2, pp. 109-125, 1981.
21. R. Tamassia, On Embedding a Graph in the Grid with the Minimum Number of Bends, SIAM J. Comput., 16, pp. 421-444, 1987.
22. K. Wittenburg and L. Weitzman, Qualitative Visualization of Processes: Attributed Graph Layout and Focusing Techniques, Proc. GD '96, LNCS 1190, Springer-Verlag, pp. 401-8, 1997.