USING STRAHLER NUMBERS FOR REAL TIME VISUAL EXPLORATION OF HUGE GRAPHS

This paper studies the problem of real time navigation in huge graphs. When size of data is becoming too large, computers are not enough powerful to enable interactive navigation without loosing the relevant part of the graph. Here, we present a method to solve this problem. This solution is based on combinatorial properties of graphs. We first introduce the reader to our generalization to rooted maps of the so-called Strahler number[22]. Subsequently we present a way to use this parameter in order to display relevant part of the graph during the navigation. Finally we give experimental results of our method.

[1]  Gregory Gutin,et al.  Digraphs - theory, algorithms and applications , 2002 .

[2]  D. Watts,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2001 .

[3]  Graham J. Wills,et al.  NicheWorks - Interactive Visualization of Very Large Graphs , 1997, GD.

[4]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[5]  Andrew B. Kahng,et al.  Recent directions in netlist partitioning: a survey , 1995, Integr..

[6]  Manojit Sarkar,et al.  Graphical fisheye views , 1994, CACM.

[7]  Colin Ware,et al.  Information Visualization: Perception for Design , 2000 .

[8]  Marti A. Hearst,et al.  Animated Exploration of Graphs with Radial Layout , 2001 .

[9]  Emden R. Gansner,et al.  Using automatic clustering to produce high-level system organizations of source code , 1998, Proceedings. 6th International Workshop on Program Comprehension. IWPC'98 (Cat. No.98TB100242).

[10]  Marti A. Hearst,et al.  Animated exploration of dynamic graphs with radial layout , 2001, IEEE Symposium on Information Visualization, 2001. INFOVIS 2001..

[11]  李幼升,et al.  Ph , 1989 .

[12]  A. N. Strahler.  Hypsometric (area-altitude) analysis of erosional topography. , 1952 .

[13]  D. Auber,et al.  A clustering algorithm for huge trees , 2003, Adv. Appl. Math..

[14]  Eli Upfal,et al.  The Web as a graph , 2000, PODS.

[15]  Ivan Herman,et al.  Density functions for visual attributes and effective partitioning in graph visualization , 2000, IEEE Symposium on Information Visualization 2000. INFOVIS 2000. Proceedings.

[16]  Carsten Friedrich,et al.  Graph Drawing in Motion II , 2001, GD.

[17]  Edward M. Reingold,et al.  Tidier Drawings of Trees , 1981, IEEE Transactions on Software Engineering.

[18]  Tamara Munzner,et al.  Drawing Large Graphs with H3Viewer and Site Manager , 1998, GD.

[19]  Andrei P. Ershov.  On programming of arithmetic operations , 1958, CACM.

[20]  P. Bourgine,et al.  Topological and causal structure of the yeast transcriptional regulatory network , 2002, Nature Genetics.

[21]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[22]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[23]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.