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 correspondingg raph 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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
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. Drawingclusters 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. Maintaininghierarc hical 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 ComputingSeries, 1995.
D. Harel. On visual formalisms. Comm. of the ACM, 31(5):588–600, 1988.
M. Himsolt. Konzeption und Implementierung von Grapheneditoren. PhD thesis, Fakultät für Mathematik und Informatik, Universität Passau, 1993.
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.
W. Lai and P. Eades. A graph model which supports flexible layout functions. Technical Report 96-15, 1996.
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 drawingof compound digraphs. IEEE Trans. Systems, Man and Cybernetics, 21(4):876–892, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Raitner, M. (2002). HGV: A Library for Hierarchies, Graphs, and Views. In: Goodrich, M.T., Kobourov, S.G. (eds) Graph Drawing. GD 2002. Lecture Notes in Computer Science, vol 2528. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36151-0_22
Download citation
DOI: https://doi.org/10.1007/3-540-36151-0_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00158-4
Online ISBN: 978-3-540-36151-0
eBook Packages: Springer Book Archive