HGV: A Library for Hierarchies, Graphs, and Views

Raitner, Marcus (2002) HGV: A Library for Hierarchies, Graphs, and Views. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 236-243 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_22).

Full text not available from this repository.

Abstract

We introduce the base architecture of a software library which combines graphs, hierarchies, and views and describes the interactions between them. Each graph may have arbitrarily many hierarchies and each hierarchy may have arbitrarily many views. Both the hierarchies and the views can be added and removed dynamically from the corresponding graph and hierarchy, respectively. The software library shall serve as a platform for algorithms and data structures on hierarchically structured graphs. Such graphs become increasingly important and occur in special applications, e. g., call graphs in software engineering or biochemical pathways, with a particular need to manipulate and draw graphs.

Item Type:Conference Paper
Additional Information:10.1007/3-540-36151-0_22
Classifications:S Software and Systems > S.001 General
ID Code:301

Repository Staff Only: item control page

References

AGD. http://www.ads.tuwien.ac.at/AGD/index.html.

Boost Graph Library. http://www.boost.org/libs/graph/doc/.

F.J. Brandenburg, M. Forster, A. Pick, M. Raitner, and F. Schreiber. Biopath. In Proc. GD 2001, LNCS 2265, pp. 451-456, 2001.

R. Brockenauer and S. Cornelsen. Drawing clusters and hierarchies. In Drawing Graphs - Methods and Models, LNCS 2025, pp. 193-227, 2001.

A.L. Buchsbaum, M.T. Goodrich, and J.R. Westbrook. Range searching over tree cross products. In 8th ESA, 2000.

A.L. Buchsbaum and J.R. Westbrook. Maintaining hierarchical graph views. In 11th ACM-SIAM Symposium on Discrete Algorithms, 2000.

P. Eades and Q.-W. Feng. Multilevel visualization of clustered graphs. In Proc. GD 1996, LNCS 1190, pp. 101-112, 1996.

E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns: Elements od Reusable Object-Oriented Software. AW Professional Computing Series, 1995.

GTL. http://www.infosun.fmi.uni-passau.de/GTL.

D. Harel. On visual formalisms. Comm. of the ACM, 31(5):588-600, 1988.

HGV. http://www.infosun.fmi.uni-passau.de/~raitner/HGV/.

M. Himsolt. Konzeption und Implementierung von Grapheneditoren. PhD thesis, Fakultät für Mathematik und Informatik, Universität Passau, 1993.

M.L. Huang and P. Eades. A fully animated interactive system for clustering and navigating huge graphs. In Proc. GD 1998, LNCS 1547, pp. 374-383, 1998.

W. Lai and P. Eades. A graph model which supports flexible layout functions. Technical Report 96-15, 1996.

LEDA. http://www.algorithmic-solutions.com/.

T. Lengauer and E. Wanke. Efficient solution of connectivity problems on hierarchically defined graphs. SIAM Journal on Computing, 17(6):1063-1080, 1988.

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.

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.