## Visual Navigation of Compound Graphs (2004)

### Cached

### Download Links

- [www.infosun.fmi.uni-passau.de]
- [www.raitner.de]
- DBLP

### Other Repositories/Bibliography

Venue: | In Proceedings of the 12th International Symposium on Graph Drawing (GD’04 |

Citations: | 2 - 0 self |

### BibTeX

@INPROCEEDINGS{Raitner04visualnavigation,

author = {Marcus Raitner},

title = {Visual Navigation of Compound Graphs},

booktitle = {In Proceedings of the 12th International Symposium on Graph Drawing (GD’04},

year = {2004},

pages = {403--413}

}

### OpenURL

### Abstract

This paper describes a local update scheme for the algorithm of Sugiyama and Misue (IEEE Trans. on Systems, Man, and Cybernetics 21 (1991) 876--892) for drawing views of compound graphs. A view is an abstract representation of a compound graph; it is generated by contracting subgraphs into meta nodes. Starting with an initial view, the underlying compound graph is explored by repeatedly expanding or contracting meta nodes. The novelty is a totally local update scheme of the algorithm of Sugiyama and Misue. It is more e#cient than redrawing the graph entirely, because the expensive steps of the algorithm, e. g., level assignment or crossing minimization, are restricted to the modified part of the compound graph. Also, the locality of the updates preserves the user's mental map: nodes not a#ected by the expand or contract operation keep their levels and their relative order; expanded edges take the same course as the corresponding contracted edge.

### Citations

152 |
Layout adjustment and the mental map
- Misue, Eades, et al.
- 1995
(Show Context)
Citation Context ...s to contract into meta nodes and which to expand. To this end, it is important that the drawing of the current view can be adjusted efficiently after these operations such that the user’s mental ma=-=p [5]-=- is preserved. In this paper, an update scheme for the compound graph drawing algorithm of Sugiyama and Misue [1] is presented. Particular emphasis is laid on the locality of the updates: every expand... |

82 | Multilevel Visualization of Clustered Graphs - Eades, Feng - 1996 |

70 |
MISUE K.: Visualization of Structural Information: Automatic Drawing of Compound Digraphs
- SUGIYAMA
- 1991
(Show Context)
Citation Context ...s the corresponding contracted edge. 1 Introduction A well-established technique to deal with huge graphs is to partition them recursively into a hierarchy of subgraphs; this leads to compound graphs =-=[1]-=- or clustered graphs [2]. Within both models, abstract representations of the graph, so-called views, can be defined [3, 4]. Intuitively, a view is generated by contracting subgraphs not needed in det... |

31 |
Dynamic graph drawing
- Branke
- 2001
(Show Context)
Citation Context ...ult to update than the local layering of Sugiyama and Misue. Dynamic or online graph drawing concentrates on updating layouts of ordinary graphs subject to insertions and deletions of nodes and edges =-=[7]-=-. The clientserver model for online hierarchical graph drawing of North and Woodhull [8] allows insertion and removal of subgraphs, but only for ordinary DAGs and not for compound graphs. By using a c... |

26 |
Maintaining hierarchical graph views
- Buchsbaum, Westbrook
- 2000
(Show Context)
Citation Context ...n them recursively into a hierarchy of subgraphs; this leads to compound graphs [1] or clustered graphs [2]. Within both models, abstract representations of the graph, so-called views, can be defined =-=[3, 4]-=-. Intuitively, a view is generated by contracting subgraphs not needed in detail into meta nodes. Edges from within the contracted subgraph to nodes outside become edges from the meta node to the outs... |

26 |
A fully animated interactive system for clustering and navigating huge graphs
- Huang, Eades
- 1998
(Show Context)
Citation Context ...of compound (or clustered) graphs by expanding and contracting nodes has been introduced by Sugiyama and Misue [1], but they seem to implement them through reapplying their algorithm. Huang and Eades =-=[10]-=- briefly describe a system for handling huge clustered graphs visually, but their layout method is force-directed. The visualization system of Abello and Korn [11] supports the interactive exploration... |

19 | Graph layout for applications in compiler construction
- Sander
- 1999
(Show Context)
Citation Context ...ate results of the previous run are adjusted with our update scheme, as described in Sect. 3. 1.2 Related Work There are several algorithms for drawing compound graphs, most notably the one of Sander =-=[6], wh-=-ich differs from the algorithm of Sugiyama and Misue [1], among other things, by its global layering. While producing more compact – and supposedly more pleasant layouts –, this global layering is... |

18 | Range searching over tree cross products
- Buchsbaum, Goodrich, et al.
- 2000
(Show Context)
Citation Context ...panded edge, whereas our method preserves the relations of the expanded part to the remainder.sAn efficient data structure supporting expand and contract, also known as graph view maintenance problem =-=[3, 4, 12]-=-, is indispensable for an efficient implementation of the update method proposed in this paper. To this end, the software architecture of [13] should be considered as well. 2 Static Compound Graph Dra... |

9 | Online hierarchical graph drawing
- North, Woodhall
- 2002
(Show Context)
Citation Context ...wing concentrates on updating layouts of ordinary graphs subject to insertions and deletions of nodes and edges [7]. The clientserver model for online hierarchical graph drawing of North and Woodhull =-=[8]-=- allows insertion and removal of subgraphs, but only for ordinary DAGs and not for compound graphs. By using a clan-based hierarchical decomposition, the incremental drawing approach for DAGs of Shieh... |

5 |
MGV: A System for Visualizing Massive Multigraphs
- Abello, Korn
- 2002
(Show Context)
Citation Context ...ing their algorithm. Huang and Eades [10] briefly describe a system for handling huge clustered graphs visually, but their layout method is force-directed. The visualization system of Abello and Korn =-=[11]-=- supports the interactive exploration of very large clustered graphs. They also use views as an abstraction of the underlying graph and provide methods for expanding edges. This expansion, however, re... |

5 | HGV: A library for hierarchies, graphs, and views
- Raitner
- 2002
(Show Context)
Citation Context ...tract, also known as graph view maintenance problem [3, 4, 12], is indispensable for an efficient implementation of the update method proposed in this paper. To this end, the software architecture of =-=[13]-=- should be considered as well. 2 Static Compound Graph Drawing We recall the algorithm of Sugiyama and Misue [1] briefly, because our update scheme uses the intermediate results of these steps. 2.1 St... |

1 | Dynamic tree cross products
- Raitner
(Show Context)
Citation Context ...n them recursively into a hierarchy of subgraphs; this leads to compound graphs [1] or clustered graphs [2]. Within both models, abstract representations of the graph, so-called views, can be defined =-=[3, 4]-=-. Intuitively, a view is generated by contracting subgraphs not needed in detail into meta nodes. Edges from within the contracted subgraph to nodes outside become edges from the meta node to the outs... |

1 |
C.L.: Clan-based incremental drawing
- Shieh, McCreary
(Show Context)
Citation Context ...ion and removal of subgraphs, but only for ordinary DAGs and not for compound graphs. By using a clan-based hierarchical decomposition, the incremental drawing approach for DAGs of Shieh and McCreary =-=[9]-=- restricts the adjustments of the layout to the modified part. Visual navigation of compound (or clustered) graphs by expanding and contracting nodes has been introduced by Sugiyama and Misue [1], but... |