## GrouseFlocks: Steerable exploration of graph hierarchy space (2008)

Venue: | IEEE TRANS. ON VISUALIZATION AND COMPUTER GRAPHICS |

Citations: | 22 - 7 self |

### BibTeX

@ARTICLE{Archambault08grouseflocks:steerable,

author = {Daniel Archambault and Tamara Munzner and David Auber},

title = {GrouseFlocks: Steerable exploration of graph hierarchy space},

journal = {IEEE TRANS. ON VISUALIZATION AND COMPUTER GRAPHICS},

year = {2008},

pages = {2008}

}

### OpenURL

### Abstract

Several previous systems allow users to interactively explore a large input graph through cuts of a superimposed hierarchy. This hierarchy is often created using clustering algorithms or topological features present in the graph. However, many graphs have domain-specific attributes associated with the nodes and edges which could be used to create many possible hierarchies providing unique views of the input graph. GrouseFlocks is a system for the exploration of this graph hierarchy space. By allowing users to see several different possible hierarchies on the same graph, the system helps users investigate graph hierarchy space instead of a single, fixed hierarchy. GrouseFlocks provides a simple set of operations so that users can create and modify their graph hierarchies based on selections. These selections can be made manually or based on patterns in the attribute data provided with the graph. It provides feedback to the user within seconds, allowing interactive exploration of this space.

### Citations

370 | Graph visualization and navigation in information visualization: A survey
- Herman, Melançon, et al.
(Show Context)
Citation Context ...allows users to investigate this space to find a graph hierarchy suitable for their tasks. III. PREVIOUS AND RELATED WORK Graph drawing and visualization has been a very active area of research [10], =-=[21]-=-, [22]. As this work investigates ways of exploring the space of graph hierarchies, we focus on work in graph drawing which involves the visualization of a graph and an associated hierarchy. We divide... |

349 |
Graph Drawing: Algorithms for the Visualization of Graphs
- Battista, Eades, et al.
- 1999
(Show Context)
Citation Context ...locks allows users to investigate this space to find a graph hierarchy suitable for their tasks. III. PREVIOUS AND RELATED WORK Graph drawing and visualization has been a very active area of research =-=[10]-=-, [21], [22]. As this work investigates ways of exploring the space of graph hierarchies, we focus on work in graph drawing which involves the visualization of a graph and an associated hierarchy. We ... |

112 | A fast adaptive layout algorithm for undirected graphs
- FRICK, LUDWIG, et al.
- 1995
(Show Context)
Citation Context ...low a metanode with an algorithm appropriate for its topology. Specific algorithms are used to draw trees [9], [19], mesh-like components [23], circular layout for complete graphs, and force-directed =-=[16]-=- when the topology is unknown. Additionally, all overlaps between metanodes and leaves are eliminated with an overlap elimination pass [12]. A crossing reduction pass minimizes edge-edge and edge-meta... |

97 | A multilevel algorithm for force-directed graph drawing
- Walshaw
- 2000
(Show Context)
Citation Context ...ally compute graph hierarchies that are used to accelerate or improve the layout process. The hierarchy construction algorithms of these approaches have been based on an estimates of maximal matching =-=[31]-=-, graph filtration based on shortest path distance in GRIP [17], local graph connectivity in FM 3 [20], and topological features in TopoLayout [5]. None of these systems address interactive hierarchy ... |

87 | Multilevel visualization of clustered graphs
- Eades, Feng
- 1996
(Show Context)
Citation Context ...re-existing graph to illustrate graph and hierarchy structure in a single drawing. Various techniques exist including: visualizing the graph and associated hierarchy extruded into the third dimension =-=[13]-=-, multi-focal fisheye approaches where metanodes are expanded and viewed in the context of the entire graph [28], topological fisheyes where abstract versions of the graph are presented far away from ... |

69 | Network visualization by semantic substrates
- Shneiderman, Aris
- 2006
(Show Context)
Citation Context ...e nodes as leaves of this hierarchy. The edges of the state transition diagram are drawn as an arc diagram between the leaves. Semantic substrates for graph layout, introduced by Shneiderman and Aris =-=[29]-=-, allows nodes to be placed based purely on attribute data, with graph topology having no effect. Intelligent edge filtration techniques display underlying adjacency and topology information to encour... |

64 | Graph drawing by high-dimensional embedding
- Harel, Koren
- 2002
(Show Context)
Citation Context ...ersion of the TopoLayout approach [5], drawing the subgraph below a metanode with an algorithm appropriate for its topology. Specific algorithms are used to draw trees [9], [19], mesh-like components =-=[23]-=-, circular layout for complete graphs, and force-directed [16] when the topology is unknown. Additionally, all overlaps between metanodes and leaves are eliminated with an overlap elimination pass [12... |

62 | Visual exploration of multivariate graphs
- Wattenberg
- 2006
(Show Context)
Citation Context ...ribute data. This high dimensional drawing is mapped down to two dimensions using principal component analysis, accentuating areas of maximal variance in the data. The PivotGraph system of Wattenberg =-=[32]-=- determines the spatial position of nodes using using high dimensional attribute data. The system divides nodes into equivalence classes, placing two nodes in the same class if they have the same valu... |

51 |
Interactive visualization of small-world graphs
- Ham, vanWijk
- 2004
(Show Context)
Citation Context ...parts of the graph on demand as requested by the user is known as a steerable system. In previous systems, most graph hierarchies have been generated automatically using graph topology [1], [2], [4], =-=[30]-=-. However, little attention has been paid to the investigation ofIEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, VOL. XX, NO. X, 200X 2 Graph Hierarchy 1 Graph Hierarchy 2 Graph Hierarchy 3... |

49 | Navigating Clustered Graph using ForceDirected Methods
- Eades
(Show Context)
Citation Context ...vestigate the concern as significant parts of the graph can be abstracted away. Only a few systems allow hierarchy editing and these systems are limited to manual selection of nodes in the graph [7], =-=[14]-=- or provide limited tools for exploring the created hierarchy [25].IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, VOL. XX, NO. X, 200X 3 In GrouseFlocks, our principal contribution is prov... |

47 | Topological fisheye views for visualizing large graphs
- Gansner, Koren, et al.
(Show Context)
Citation Context ...isheye approaches where metanodes are expanded and viewed in the context of the entire graph [28], topological fisheyes where abstract versions of the graph are presented far away from a focus centre =-=[18]-=-, linking the graph hierarchy to a separate treemap view [1], interactively visualizing hierarchies of small world clusterings [30], and visualization of complex software in three dimensions using lev... |

42 | ASK-GraphView: A large scale graph visualization system
- Abello, Ham, et al.
(Show Context)
Citation Context ...ich draws parts of the graph on demand as requested by the user is known as a steerable system. In previous systems, most graph hierarchies have been generated automatically using graph topology [1], =-=[2]-=-, [4], [30]. However, little attention has been paid to the investigation ofIEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, VOL. XX, NO. X, 200X 2 Graph Hierarchy 1 Graph Hierarchy 2 Graph ... |

39 | GRIP: Graph drawing with intelligent placement
- Gajer, Kobourov
- 2000
(Show Context)
Citation Context ...mprove the layout process. The hierarchy construction algorithms of these approaches have been based on an estimates of maximal matching [31], graph filtration based on shortest path distance in GRIP =-=[17]-=-, local graph connectivity in FM 3 [20], and topological features in TopoLayout [5]. None of these systems address interactive hierarchy exploration. They use the hierarchy to accelerate layout of the... |

37 | TopoLayout: Multi-Level graph layout by topological features - Archambault, Munzner, et al. |

36 |
Drawing large graphs with a potential-fieldbased multilevel algorithm (extended abstract
- Hachul, Jünger
- 2004
(Show Context)
Citation Context ...y construction algorithms of these approaches have been based on an estimates of maximal matching [31], graph filtration based on shortest path distance in GRIP [17], local graph connectivity in FM 3 =-=[20]-=-, and topological features in TopoLayout [5]. None of these systems address interactive hierarchy exploration. They use the hierarchy to accelerate layout of the graph and present a final drawing. Alt... |

28 |
Tulip: a huge graph visualization framework
- Auber
- 2003
(Show Context)
Citation Context ...minute. All metanode opening and closing operations on a specific hierarchy took only a few seconds. VII. COMPARISON OF HIERARCHIES We implemented GrouseFlocks using the Tulip graph drawing libraries =-=[6]-=- and Grouse [4]. In this section, we compare the interactively created hierarchies of GrouseFlocks to the static topological feature hierarchies of Grouse. ASK-GraphView [2] produces similar hierarchi... |

28 | Fast node overlap removal
- Dwyer, Marriott, et al.
- 2005
(Show Context)
Citation Context ...23], circular layout for complete graphs, and force-directed [16] when the topology is unknown. Additionally, all overlaps between metanodes and leaves are eliminated with an overlap elimination pass =-=[12]-=-. A crossing reduction pass minimizes edge-edge and edge-metanode crossings by rotating metanodes according to a computed torque value. GrouseFlocks uses the interactive hierarchy browsing capabilitie... |

22 | Level-of-detail visualization of clustered graph layouts
- Balzer, Deussen
- 2007
(Show Context)
Citation Context ...archy to a separate treemap view [1], interactively visualizing hierarchies of small world clusterings [30], and visualization of complex software in three dimensions using level of detail techniques =-=[8]-=-. In all of these techniques a static layout is computed once up front, and a static hierarchy is computed from it relating to the spatial position of the vertices in the drawing. GrouseFlocks support... |

22 |
Graph visualization techniques for web clustering engines
- Giacomo, Didimo, et al.
(Show Context)
Citation Context ...isting layout of their graphs, allowing exploration to begin immediately. As they do not require this layout, they can more readily be used for exploration of graph hierarchy space. Di Giacomo et al. =-=[11]-=- present a system for visualizing a graph and a associated hierarchy both created by a search engine query. In their system, a search query produces a graph: a set of documents, which are the nodes, a... |

21 | Improving Walker’s algorithm to run in linear time
- Buchheim, Jünger, et al.
- 2002
(Show Context)
Citation Context ...rouseFlocks uses a progressive version of the TopoLayout approach [5], drawing the subgraph below a metanode with an algorithm appropriate for its topology. Specific algorithms are used to draw trees =-=[9]-=-, [19], mesh-like components [23], circular layout for complete graphs, and force-directed [16] when the topology is unknown. Additionally, all overlaps between metanodes and leaves are eliminated wit... |

19 |
Visual analysis of multivariate state transition graphs
- PRETORIUS, WIJK
- 2006
(Show Context)
Citation Context ...ve the same value for the attribute being examined. These equivalence classes are used to influence spatial position or simplify the graph structure, producing a final drawing. Pretorius and van Wijk =-=[27]-=- authored a second work which allows for the exploration of a state transition diagram using an attribute-based hierarchy. In their work, they recursively divide the nodes of the graph recursively by ... |

16 |
Bubble tree drawing algorithm
- Grivet, Auber, et al.
- 2004
(Show Context)
Citation Context ...Flocks uses a progressive version of the TopoLayout approach [5], drawing the subgraph below a metanode with an algorithm appropriate for its topology. Specific algorithms are used to draw trees [9], =-=[19]-=-, mesh-like components [23], circular layout for complete graphs, and force-directed [16] when the topology is unknown. Additionally, all overlaps between metanodes and leaves are eliminated with an o... |

13 |
Grouse: Feature-based, steerable graph hierarchy exploration
- Archambault, Munzner, et al.
- 2007
(Show Context)
Citation Context ...raws parts of the graph on demand as requested by the user is known as a steerable system. In previous systems, most graph hierarchies have been generated automatically using graph topology [1], [2], =-=[4]-=-, [30]. However, little attention has been paid to the investigation ofIEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, VOL. XX, NO. X, 200X 2 Graph Hierarchy 1 Graph Hierarchy 2 Graph Hiera... |

11 | Visualizing large graphs with compound-fisheye views and treemaps
- Abello, Kobourov, et al.
- 2004
(Show Context)
Citation Context ...em which draws parts of the graph on demand as requested by the user is known as a steerable system. In previous systems, most graph hierarchies have been generated automatically using graph topology =-=[1]-=-, [2], [4], [30]. However, little attention has been paid to the investigation ofIEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, VOL. XX, NO. X, 200X 2 Graph Hierarchy 1 Graph Hierarchy 2 G... |

11 | Smashing peacocks further: Drawing quasitrees from biconnected components
- Archambault, Munzner, et al.
(Show Context)
Citation Context ... graph may not provide a useful level of abstraction for users and can be visually overwhelming. Additionally, a layout of the entire graph is costly to compute, requiring minutes and sometimes hours =-=[3]-=-. Previous interactive systems used to explore this data have solved D. Archambault and T. Munzner are with the Department of Computer Science, University of British Columbia. Email {archam, tmm}@cs.u... |

8 | Interactive refinement of multi-scale network clusterings
- Auber, Jourdan
- 2008
(Show Context)
Citation Context ...to investigate the concern as significant parts of the graph can be abstracted away. Only a few systems allow hierarchy editing and these systems are limited to manual selection of nodes in the graph =-=[7]-=-, [14] or provide limited tools for exploring the created hierarchy [25].IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, VOL. XX, NO. X, 200X 3 In GrouseFlocks, our principal contribution i... |

8 |
Information Visualization Using Composable Layouts and Visual Sets
- Pattison, Vernik, et al.
- 2001
(Show Context)
Citation Context ...tracted away. Only a few systems allow hierarchy editing and these systems are limited to manual selection of nodes in the graph [7], [14] or provide limited tools for exploring the created hierarchy =-=[25]-=-.IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, VOL. XX, NO. X, 200X 3 In GrouseFlocks, our principal contribution is providing a system to interactively explore and modify graph hierarchi... |

8 |
et al., Navigating Hierarchically Clustered Networks Through Fish-eye and Full-Zoom Methods
- Schaffer
- 1995
(Show Context)
Citation Context ...uding: visualizing the graph and associated hierarchy extruded into the third dimension [13], multi-focal fisheye approaches where metanodes are expanded and viewed in the context of the entire graph =-=[28]-=-, topological fisheyes where abstract versions of the graph are presented far away from a focus centre [18], linking the graph hierarchy to a separate treemap view [1], interactively visualizing hiera... |

6 |
Multidimensional Visualization of Transition Systems
- Pretorius, Wijk
(Show Context)
Citation Context .... However, much of this work does not take the topological structure of the graph into account.IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, VOL. XX, NO. X, 200X 4 Pretorius and van Wijk =-=[26]-=- describe a system to map multidimensional attribute data associated with the nodes and edges of a graph to spatial position of the nodes. In their approach, nodes are placed in the high dimensional s... |