摘要: This paper studies the problem of real time navigation in huge graphs. When size data is becoming too large, computers are not enough powerful to enable interactive without loosing relevant part graph. Here, we present a method solve this problem. solution based on combinatorial properties We first introduce reader our generalization rooted maps so-called Strahler number[22]. Subsequently way use parameter order display graph during navigation. Finally give experimental results method.
archives-ouvertes.fr参考文章(20)
Gregory Z. Gutin, Jrgen Bang-Jensen, Digraphs: Theory, Algorithms and Applications ,(2002)
Tamara Munzner, Drawing Large Graphs with H3Viewer and Site Manager graph drawing. pp. 384- 393 ,(1998) , 10.1007/3-540-37623-2_30
Colin Ware, Information Visualization: Perception for Design ,(2000)
Carsten Friedrich, Michael E. Houle, Graph Drawing in Motion II graph drawing. pp. 220- 231 ,(2001) , 10.1007/3-540-45848-4_18
S. Mancoridis, B.S. Mitchell, C. Rorres, Y. Chen, E.R. Gansner, Using automatic clustering to produce high-level system organizations of source code workshop on program comprehension. pp. 45- 52 ,(1998) , 10.1109/WPC.1998.693283
Richard C. Dubes, Anil K. Jain, Algorithms for clustering data ,(1988)
D. Auber, M. Delest, A clustering algorithm for huge trees Advances in Applied Mathematics. ,vol. 31, pp. 46- 60 ,(2003) , 10.1016/S0196-8858(02)00505-5
Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Dandapani Sivakumar, Andrew Tompkins, Eli Upfal, None, The Web as a graph symposium on principles of database systems. pp. 1- 10 ,(2000) , 10.1145/335168.335170
Charles J Alpert, Andrew B Kahng, None, Recent directions in netlist partitioning: a survey Integration. ,vol. 19, pp. 1- 81 ,(1995) , 10.1016/0167-9260(95)00008-4
A. P. Ershov, On programming of arithmetic operations Communications of The ACM. ,vol. 1, pp. 3- 6 ,(1958) , 10.1145/368892.368907