IES-Backbone: An Interactive Edge Selection Based Backbone Method for Small World Network Visualization
暂无分享,去创建一个
Yang Wang | Daoyu Lin | Hui Wang | Daobing Zhang | Cheng Zhan | Yang Wang | Daoyu Lin | Daobing Zhang | Hui Wang | Cheng Zhan
[1] Peter Eades,et al. A Heuristic for Graph Drawing , 1984 .
[2] Martin Wattenberg,et al. Centrality Based Visualization of Small World Graphs , 2008, Comput. Graph. Forum.
[3] Darren Edge,et al. Trimming the Hairball: Edge Cutting Strategies for Making Dense Graphs Usable , 2018, 2018 IEEE International Conference on Big Data (Big Data).
[4] Edward M. Reingold,et al. Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..
[5] Yehuda Koren,et al. The Binary Stress Model for Graph Drawing , 2009, GD.
[6] Peter Eades,et al. On the faithfulness of graph visualizations , 2012, 2013 IEEE Pacific Visualization Symposium (PacificVis).
[7] Zachary P. Neal,et al. How small is it? Comparing indices of small worldliness , 2017, Network Science.
[8] Nikhil Srivastava,et al. Graph Sparsification by Effective Resistances , 2011, SIAM J. Comput..
[9] Fang Zhou,et al. Network Simplification with Minimal Loss of Connectivity , 2010, 2010 IEEE International Conference on Data Mining.
[10] Jean-Loup Guillaume,et al. Fast unfolding of communities in large networks , 2008, 0803.0476.
[11] Aric Hagberg,et al. Exploring Network Structure, Dynamics, and Function using NetworkX , 2008, Proceedings of the Python in Science Conference.
[12] Ulrik Brandes,et al. Untangling the Hairballs of Multi-Centered, Small-World Online Social Media Networks , 2015, J. Graph Algorithms Appl..
[13] Mason A. Porter,et al. Comparing Community Structure to Characteristics in Online Collegiate Social Networks , 2008, SIAM Rev..
[14] Shang-Hua Teng,et al. Spectral sparsification of graphs: theory and algorithms , 2013, CACM.
[15] Michael Garland,et al. On the Visualization of Social and other Scale-Free Networks , 2008, IEEE Transactions on Visualization and Computer Graphics.
[16] Attila Szolnoki,et al. Statistical Physics of Human Cooperation , 2017, ArXiv.
[17] Paul Vickers,et al. A survey of two-dimensional graph layout techniques for information visualisation , 2013, Inf. Vis..
[18] K. Gurney,et al. Network ‘Small-World-Ness’: A Quantitative Method for Determining Canonical Network Equivalence , 2008, PloS one.
[19] Matjaz Perc,et al. The Matthew effect in empirical data , 2014, Journal of The Royal Society Interface.
[20] Ulrik Brandes,et al. Adaptive Disentanglement Based on Local Clustering in Small-World Network Visualization , 2016, IEEE Transactions on Visualization and Computer Graphics.
[21] G. Simmel. The sociology of Georg Simmel , 1950 .
[22] Yan Huang,et al. Distance Preserving Graph Simplification , 2011, 2011 IEEE 11th International Conference on Data Mining.
[23] Yain-Whar Si,et al. Force-directed algorithms for schematic drawings and placement: A survey , 2019, Inf. Vis..
[24] Ulrik Brandes,et al. Quality Metrics for Information Visualization , 2018, Comput. Graph. Forum.
[25] Peter Eades,et al. Proxy Graph: Visual Quality Metrics of Big Graph Sampling , 2017, IEEE Transactions on Visualization and Computer Graphics.
[26] U. Brandes. A faster algorithm for betweenness centrality , 2001 .
[27] Ben Shneiderman,et al. Readability metric feedback for aiding node-link visualization designers , 2015, IBM J. Res. Dev..
[28] M. Jacomy,et al. ForceAtlas2, a Continuous Graph Layout Algorithm for Handy Network Visualization Designed for the Gephi Software , 2014, PloS one.
[29] George Michailidis,et al. Graph Layout Techniques and Multidimensional Data Analysis , 1999 .
[30] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.
[31] Ulrik Brandes,et al. Simmelian backbones: Amplifying hidden homophily in Facebook networks , 2013, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013).
[32] Dirk Helbing,et al. Saving Human Lives: What Complexity Science and Information Systems can Contribute , 2014, Journal of statistical physics.
[33] Satoru Kawai,et al. An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..
[34] Yehuda Koren,et al. Graph Drawing by Stress Majorization , 2004, GD.
[35] Leonard M. Freeman,et al. A set of measures of centrality based upon betweenness , 1977 .