FADE: Graph Drawing, Clustering, and Visual Abstraction
暂无分享,去创建一个
[1] Peter Eades,et al. On-line Animated Visualization of Huge Graphs using a Modified Spring Algorithm , 1998, J. Vis. Lang. Comput..
[2] Guy E. Blelloch,et al. A practical comparison of N-body algorithms , 1994, Parallel Algorithms.
[3] Arne Frick,et al. Automatic Graph Clustering , 1996, GD.
[4] Vladimir Batagelj,et al. Partitioning Approach to Visualization of Large Graphs , 1999, GD.
[5] S. Teng. Points, spheres, and separators: a unified geometric approach to graph partitioning , 1992 .
[6] Robert F. Ling,et al. Cluster analysis algorithms for data reduction and classification of objects , 1981 .
[7] John A. Hartigan,et al. Clustering Algorithms , 1975 .
[8] David Harel,et al. A Fast Multi-scale Method for Drawing Large Graphs , 2000, Graph Drawing.
[9] R W Hockney,et al. Computer Simulation Using Particles , 1966 .
[10] Ivan Herman,et al. Latour - A Tree Visualisation System , 1999, Graph Drawing.
[11] François Bertault. A Force-Directed Algorithm that Preserves Edge Crossing Properties , 1999, Graph Drawing.
[12] Arunabha Sen,et al. Graph Clustering Using Distance-k Cliques , 1999, GD.
[13] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[14] L. Greengard,et al. A Fast Adaptive Multipole Algorithm for Particle Simulations , 1988 .
[15] J. CARRIERt,et al. A FAST ADAPTIVE MULTIPOLE ALGORITHM FOR PARTICLE SIMULATIONS * , 2022 .
[16] Richard J. Anderson. Tree Data Structures for N-Body Simulation , 1999, SIAM J. Comput..
[17] Kozo Sugiyama,et al. A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm , 1994, GD.
[18] Peter Eades,et al. A Heuristic for Graph Drawing , 1984 .
[19] Daniel Tunkelang,et al. JIGGLE: Java Interactive Graph Layout Environment , 1998, GD.
[20] M. Lorr. Cluster analysis for social scientists , 1938 .
[21] Jiong Yang,et al. STING: A Statistical Information Grid Approach to Spatial Data Mining , 1997, VLDB.
[22] François Bertault,et al. A force-directed algorithm that preserves edge-crossing properties , 1999, Inf. Process. Lett..
[23] Jiong Yang,et al. STING+: an approach to active spatial data mining , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).
[24] Paul Gibbon,et al. Many-body tree methods in physics , 1996 .
[25] Manojit Sarkar,et al. Graphical fisheye views of graphs , 1992, CHI.
[26] Edward R. Tufte,et al. The Visual Display of Quantitative Information , 1986 .
[27] Edward Tufte,et al. Visual Explanations , 1997 .
[28] Edward M. Reingold,et al. Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..
[29] L. Hernquist. Hierarchical N-body methods , 1987 .
[30] Piet Hut,et al. A hierarchical O(N log N) force-calculation algorithm , 1986, Nature.
[31] Kozo Sugiyama,et al. Layout Adjustment and the Mental Map , 1995, J. Vis. Lang. Comput..
[32] David Harel,et al. A multi-scale algorithm for drawing graphs nicely , 2001, Discret. Appl. Math..
[33] Edward R. Tufte,et al. Envisioning Information , 1990 .
[34] Kim Marriott,et al. Constrained Graph Layout , 1996, Graph Drawing.
[35] Vipin Kumar,et al. A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering , 1998, J. Parallel Distributed Comput..
[36] Vipin Kumar,et al. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..
[37] Robert F. Cohen,et al. How to Draw a Planar Clustered Graph , 1995, COCOON.