TugGraph: Path-Preserving Hierarchies for Browsing Prozimity and Paths in Graphs
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.
Graph Visualization Prozimity Graph Hierarchies
Daniel Archambault Tamara Munzner David Auber
University of British Columbia & INRIA Bordeaux Sud-Ouest University of British Columbia University of Bordeaux
国际会议
IEEE Pacific Visualization Symposium 2009(2009 IEEE太平洋可视化研讨会)
北京
英文
113-120
2009-04-29（万方平台首次上网日期，不代表论文的发表时间）