Hierarchical Graph Maps

被引：12

作者：

Abello, J ^{[1
]}

机构：

[1] Rutgers State Univ, DIMACS Ctr, Piscataway, NJ 08854 USA

来源：

COMPUTERS & GRAPHICS-UK | 2004年 / 28卷 / 03期

基金：

美国国家科学基金会;

关键词：

visualization; massive data sets; graphs; hierarchy trees;

D O I：

10.1016/j.cag.2004.03.012

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Graphs and maps are powerful abstractions. Their combination, Hierarchical Graph Maps, provide effective tools to process a graph that is too large to fit on the screen. They provide hierarchical visual indices (i.e. maps) that guide navigation and visualization. Hierarchical graph maps deal in a unified manner with both the screen and I/O bottlenecks. This line of thinking adheres to the Visual Information Seeking Mantra: Overview first, zoom and filter, then details on demand (Information Visualization: dynamic queries, star field displays and lifelines, in www.cr.umd.edu, 1997). We highlight the main tasks behind the computation of Graph Maps and provide several examples. The techniques have been used experimentally in the navigation of graphs defined on vertex sets ranging from 100 to 250 million vertices. (C) 2004 Elsevier Ltd. All rights reserved.

引用

页码：345 / 359

页数：15

共 17 条

[11]

Eades P., 1996, PROC INT S GRAPH DRA, P113

[12]

EADES P, 1996, LNCS, V1190, P101

[13]

Faloutsos M, 1999, COMP COMM R, V29, P251, DOI 10.1145/316194.316229

[14]

GAJER P, 2000, LECT NOTES COMPUTER

[15] Improved algorithms and data structures for solving graph problems in external memory [J].

Kumar, V ;

Schwabe, EJ .

EIGHTH IEEE SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 1996, :169-176

[16]

RAUSCHENBACH U, 2000, P INT INT ASS MOB CO

[17] VISUALIZATION OF STRUCTURAL INFORMATION - AUTOMATIC DRAWING OF COMPOUND DIGRAPHS [J].

SUGIYAMA, K ;

MISUE, K .

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1991, 21 (04) :876-892

← 1 2 →