Visualization of Large Networks
Publisher
Springer New York
Reference41 articles.
1. Akoglu L, McGlohon M, Faloutsos C (2010) Oddball: spotting anomalies in weighted graphs. In: Proceedings of the 14th Pacific-Asia conference on advances in knowledge discovery and data mining (PAKDD 2010), Hyderabad
2. Alper B, Hollerer T, Kuchera-Morin J, Forbes A (2011) Stereoscopic highlighting: 2D graph visualization on stereo displays. IEEE Trans Vis Comput Graph 9:2325–2333
3. Barnes J, Hut P (1986) A hierarchical O(N logN) force-calculation algorithm. Nature 324:446–449
4. Brandes U, Mader M (2012) A quantitative comparison of stress-minimization approaches for offline dynamic graph drawing. In: Proceedings of the 19th international symposium on graph drawing (GD’11). Eindhoven, pp 99–110
5. Brandes U, Pich C (2007) Eigensolver methods for progressive multidimensional scaling of large data. In: Proceedings of the 14th international symposium on graph drawing (GD’06, Karlsruhe). Lecture notes in computer science, vol. 4372, pp 42–53