论文信息 - Maintaining hierarchical graph views

Maintaining hierarchical graph views

We formalize the problem of maintaining views of graphs. These are graphs induced by the contraction of vertex subsets that are defined by associated hierarchies. We provide data structures that allow applications to refine and coarsen such views interactively and efficiently, in time linear in the number of changes induced by any exploration operation. The problem is motivated by applications in graph visualization.

Jeffery R. Westbrook | Adam L. Buchsbaum | A. Buchsbaum | J. Westbrook

[1] Hausi A. Müller,et al. Graph Layout Adjustment Strategies , 1995, GD.

[2] Tamara Munzner,et al. Drawing Large Graphs with H3Viewer and Site Manager , 1998, GD.

[3] Friedhelm Meyer auf der Heide,et al. Dynamic perfect hashing: upper and lower bounds , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[4] James Abello,et al. Navigating Graph Surfaces , 2000 .

[5] Xuemin Lin,et al. Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs , 1996, Graph Drawing.

[6] Uzi Vishkin,et al. Finding Level-Ancestors in Trees , 1994, J. Comput. Syst. Sci..

[7] Robert E. Tarjan,et al. Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..

[8] Peter Eades,et al. A Fully Animated Interactive System for Clustering and Navigating Huge Graphs , 1998, GD.

[9] Uzi Vishkin,et al. On Finding Lowest Common Ancestors: Simplification and Parallelization , 1988, AWOC.

[10] Robert E. Tarjan,et al. Applications of Path Compression on Balanced Trees , 1979, JACM.

[11] Kozo Sugiyama,et al. A Generic Compound Graph Visualizer/Manipulator: D-ABDUCTOR , 1995, Graph Drawing.

[12] Paul F. Dietz. Finding Level-Ancestors in Dynamic Trees , 1991, WADS.

[13] David Harel,et al. On visual formalisms , 1988, CACM.

[14] Harold N. Gabow,et al. Data structures for weighted matching and nearest common ancestors with linking , 1990, SODA '90.