title: Tugging graphs faster: efficiently modifying path-preserving hierarchies for browsing paths.
abstract: 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.
authors.affiliation: INRIA Bordeaux Sud-Ouest, Universite de Bordeaux I, 351 cours de la Liberation, Bat A30, 33405 Talence, France. daniel.archambault@inria.fr
authors.forename: Daniel
authors.initials: D
authors.lastname: Archambault
authors.forename: Tamara
authors.initials: T
authors.lastname: Munzner
authors.forename: David
authors.initials: D
authors.lastname: Auber
mesh_terms: D000465:Algorithms; D003196:Computer Graphics; D016247:Information Storage and Retrieval / Q000379:methods; D012984:Software; D014584:User-Computer Interface