Graph sketches

被引：5

作者：

Abello, J

Finocchi, I

Korn, J

机构：

来源：

IEEE SYMPOSIUM ON INFORMATION VISUALIZATION 2001, PROCEEDINGS | 2001年

关键词：

visualization; massive data sets; graphs; hierarchies;

D O I：

10.1109/INFVIS.2001.963282

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We introduce the notion of Graph Sketches. They can be thought of as visual indices that guide the navigation of a multi-graph too large to fit on the available display. We adhere to the Visual Information-Seeking Mantra: Overview first, zoom and filter, then details on demand. Graph Sketches are incorporated into MGV, an integrated visualization and exploration system for massive multi-digraph navigation. We highlight the main algorithmic and visualization tasks behind the computation of Graph Sketches and illustrate several application scenarios. Graph Sketches will be used to guide the navigation of multi-digraphs defined on vertex sets with sizes ranging from 100 to 250 million vertices.

引用

页码：67 / 70

页数：4

共 13 条

[1] Visualizing massive multi-digraphs [J].

Abello, J ;

Korn, J .

IEEE SYMPOSIUM ON INFORMATION VISUALIZATION 2000, 2000, :39-47

[2]

ABELLO J, 1999, APPROXIMATION COMPLE, P1

[3]

ABELLO J, 1998, LECT NOTES COMPUTER, V1461, P332

[4]

ABELLO J, 1999, AMS DIMACS SERIES DI, V50

[5] Graph structure in the Web [J].

Broder, A ;

Kumar, R ;

Maghoul, F ;

Raghavan, P ;

Rajagopalan, S ;

Stata, R ;

Tomkins, A ;

Wiener, J .

COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING, 2000, 33 (1-6) :309-320

[6]

COWEN L, 1994, DIMACS TR SERIES, V9456

[7]

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

[8]

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

[9]

GAJER P, 2000, LECT NOTES COMPUTER

[10]

KARABEG D, 1988, CS88120 U CAL SAN DI

← 1 2 →