Result: TugGraph: Path-Preserving Hierarchies for Browsing Proximity and Paths in Graphs

Title:
TugGraph: Path-Preserving Hierarchies for Browsing Proximity and Paths in Graphs
Authors:
Archambault, Daniel, Munzner, Tamara, Auber, David
Contributors:
Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), Graph Visualization and Interactive Exploration (GRAVITE), Université Sciences et Technologies - Bordeaux 1 (UB)-Centre Inria de l'Université de Bordeaux, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), University of British Columbia [Canada] (UBC)
Source:
IEEE Pacific Visualization Symposium. :113-121
Publisher Information:
CCSD, 2009.
Publication Year:
2009
Collection:
collection:CNRS
collection:INRIA
collection:ENSEIRB
collection:INRIA-BORDEAUX
collection:UNIV-BORDEAUX
collection:INRIA_TEST
collection:TESTALAIN1
collection:LABRI-MABIOVIS
collection:TESTBORDEAUX
collection:INRIA2
collection:INRIA-CANADA
collection:UNIVERSITE-BORDEAUX
Subject Terms:
Graph Visualization, Proximity, Graph Hierarchies, ACM: H.: Information Systems, H.5: INFORMATION INTERFACES AND PRESENTATION (e.g., HCI), H.5.0: General, ACM: G.: Mathematics of Computing, G.2: DISCRETE MATHEMATICS, G.2.2: Graph Theory, G.2.2.0: Graph algorithms, [INFO.INFO-HC]Computer Science [cs], Human-Computer Interaction [cs.HC]
Subject Geographic:
Pekin, China
Original Identifier:
HAL:
Document Type:
Conference conferenceObject<br />Conference papers
Language:
English
Access URL:
https://inria.hal.science/inria-00413858
https://inria.hal.science/inria-00413858v1/document
https://inria.hal.science/inria-00413858v1/file/tugGraph.pdf
Rights:
info:eu-repo/semantics/OpenAccess
Accession Number:
edshal.inria.00413858v1
Database:
HAL

Further Information

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 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.