Tugging Graphs Faster: Efficiently Modifying Path-Preserving Hierarchies for Browsing Paths - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Visualization and Computer Graphics Année : 2010

Tugging Graphs Faster: Efficiently Modifying Path-Preserving Hierarchies for Browsing Paths

Résumé

Many graph visualization systems use graph hierarchies to organize a large input graph into logical components. These approaches detect features globally in the data and place these features inside levels of a hierarchy. However, this feature detection is a global process and does not consider nodes of the graph near a feature of interest. TugGraph is a system for exploring paths and proximity around nodes and subgraphs in a graph. The approach modifies a pre-existing hierarchy in order to see how a node or subgraph of interest extends out into the larger graph. It is guaranteed to create path-preserving hierarchies, so that the abstraction shown is meaningful with respect to the underlying structure of the graph. The system works well on graphs of hundreds of thousands of nodes and millions of edges. TugGraph is able to present views of this proximal information in the context of the entire graph in seconds, and does not require a layout of the full graph as input.
Fichier principal
Vignette du fichier
pacificVisTVCG.pdf (5.67 Mo) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

inria-00413861 , version 1 (29-11-2010)

Identifiants

  • HAL Id : inria-00413861 , version 1

Citer

Daniel Archambault, Tamara Munzner, David Auber. Tugging Graphs Faster: Efficiently Modifying Path-Preserving Hierarchies for Browsing Paths. IEEE Transactions on Visualization and Computer Graphics, 2010. ⟨inria-00413861⟩
393 Consultations
189 Téléchargements

Partager

Gmail Facebook X LinkedIn More