Communications of the ACM
Efficient solution to connectivity problems on hierarchically defined graphs
SIAM Journal on Computing
Design patterns: elements of reusable object-oriented software
Design patterns: elements of reusable object-oriented software
Maintaining hierarchical graph views
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Drawing clusters and hierarchies
Drawing graphs
A Fully Animated Interactive System for Clustering and Navigating Huge Graphs
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Range Searching Over Tree Cross Products
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Multilevel Visualization of Clustered Graphs
GD '96 Proceedings of the Symposium on Graph Drawing
Managing attack graph complexity through visual hierarchical aggregation
Proceedings of the 2004 ACM workshop on Visualization and data mining for computer security
A layout algorithm for undirected compound graphs
Information Sciences: an International Journal
A calculus effectively performing event formation with visualization
ISHPC'05/ALPS'06 Proceedings of the 6th international symposium on high-performance computing and 1st international conference on Advanced low power systems
Visual navigation of compound graphs
GD'04 Proceedings of the 12th international conference on Graph Drawing
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Completely connected clustered graphs
Journal of Discrete Algorithms
| Hi-index | 0.00 |
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.