HGV: A library for hierarchies, graphs, and views

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

Volumn 2528 LNCS, Issue , 2002, Pages 236-243

  Raitner, Marcus ^a  

^a UNIVERSITY OF PASSAU   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); APPLICATION PROGRAMS; SOFTWARE ENGINEERING;

ALGORITHMS AND DATA STRUCTURES; BIOCHEMICAL PATHWAY; CALL GRAPHS; SOFTWARE LIBRARIES; SPECIAL APPLICATIONS; STRUCTURED GRAPHS;

APPLICATION PROGRAMS; GRAPHIC METHODS;

EID: 23044534356     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36151-0_22     Document Type: Conference Paper

References (18)

1. AGD. http://www.ads.tuwien.ac.at/AGD/index.html.
2. Boost Graph Library. http://www.boost.org/libs/graph/doc/.
3. F. J. Brandenburg, M. Forster, A. Pick, M. Raitner, and F. Schreiber. Biopath. In Proc. GD 2001, LNCS 2265, pp. 451-456, 2001.
4. R. Brockenauer and S. Cornelsen. Drawingclusters and hierarchies. In Drawing Graphs - Methods and Models, LNCS 2025, pp. 193-227, 2001.
5. A. L. Buchsbaum, M. T. Goodrich, and J. R. Westbrook. Range searching over tree cross products. In 8th ESA, 2000.
6. A. L. Buchsbaum and J. R. Westbrook. Maintaininghierarchical graph views. In 11th ACM-SIAM Symposium on Discrete Algorithms, 2000.
7. P. Eades and Q.-W. Feng. Multilevel visualization of clustered graphs. In Proc. GD 1996, LNCS 1190, pp. 101-112, 1996.
8. E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns: Elements od Reusable Object-Oriented Software. AW Professional ComputingSeries, 1995.
9. GTL. http://www.infosun.fmi.uni-passau.de/GTL.
10. D. Harel. On visual formalisms. Comm. of the ACM, 31(5):588-600, 1988.
11. HGV. http://www.infosun.fmi.uni-passau.de/~raitner/HGV/.
12. M. Himsolt. Konzeption und Implementierung von Grapheneditoren. PhD thesis, Fakultät für Mathematik und Informatik, Universität Passau, 1993.
13. M. L. Huangand P. Eades. A fully animated interactive system for clusteringand navigating huge graphs. In Proc. GD 1998, LNCS 1547, pp. 374-383, 1998.
14. W. Lai and P. Eades. A graph model which supports flexible layout functions. Technical Report 96-15, 1996.
15. LEDA. http://www.algorithmic-solutions.com/.
16. T. Lengauer and E. Wanke. Efficient solution of connectivity problems on hierarchically defined graphs. SIAM Journal on Computing, 17(6):1063-1080, 1988.
17. I. A. Lisitsyn and V. N. Kasyanov. Higres - visualization system for clustered graphs and graph algorithms. In Proc. GD 1999, LNCS 1731, pp. 82-89, 1999.
18. K. Sugiyama and K. Misue. Visualization of structural information: Automatic drawing of compound digraphs. IEEE Trans. Systems, Man and Cybernetics, 21(4):876-892, 1991.