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

被引:17
作者
Archambault, Daniel [1 ,2 ]
Munzner, Tamara [1 ]
Auber, David [3 ]
机构
[1] Univ British Columbia, Vancouver, BC V5Z 1M9, Canada
[2] INRIA Bordeaux Sud Ouest, Bordeaux, France
[3] Univ Bordeaux, Bordeaux, France
来源
IEEE PACIFIC VISUALIZATION SYMPOSIUM 2009, PROCEEDINGS | 2009年
关键词
Graph Visualization; Proximity; Graph Hierarchies; FISHEYE VIEWS;
D O I
10.1109/PACIFICVIS.2009.4906845
中图分类号
TP18 [人工智能理论];
学科分类号
140502 [人工智能];
摘要
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.
引用
收藏
页码:113 / +
页数:2
相关论文
共 21 条
[1]
Abello J, 2004, LECT NOTES COMPUT SC, V3383, P431
[2]
ASK-GraphView: A large scale graph visualization system [J].
Abello, James ;
van Ham, Frank ;
Krishnan, Neeraj .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2006, 12 (05) :669-676
[3]
LGL: Creating a map of protein function with an algorithm for visualizing very large biological networks [J].
Adai, AT ;
Date, SV ;
Wieland, S ;
Marcotte, EM .
JOURNAL OF MOLECULAR BIOLOGY, 2004, 340 (01) :179-190
[4]
[Anonymous], J GRAPH ALGORITHMS A
[5]
[Anonymous], 2004, Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
[6]
Archambault D., 2007, EUROGRAPHICSIEEE VGT, P67
[7]
GrouseFlocks: Steerable exploration of graph hierarchy space [J].
Archambault, Daniel ;
Munzner, Tamara ;
Auber, David .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2008, 14 (04) :900-913
[8]
Smashing peacocks further: Drawing quasi-trees from biconnected components [J].
Archambault, Daniel ;
Munzner, Tamara ;
Auber, David .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2006, 12 (05) :813-820
[9]
Interactive refinement of multi-scale network clusterings [J].
Auber, D ;
Jourdan, F .
NINTH INTERNATIONAL CONFERENCE ON INFORMATION VISUALISATION, PROCEEDINGS, 2005, :703-709
[10]
Auber D, 2004, MATH VIS, P105