Graph visualization is an area of mathematics and computer science, at the intersection of geometric graph theory and information visualization. It is concerned with visual representation of graphs that reveals structures and anomalies that may be present in the data and helps the user to understand and reason about the graphs.
Graph visualization is concerned with visual representations of graph or network data. Effective graph visualization reveals structures that may be present in the graphs and helps the users to understand and analyze the underlying data.
A graph consists of nodes and edges. It is a mathematical structure describing relations among a set of entities, where a node represents an entity, and an edge exists between two nodes if the two corresponding entities are related.
A graph can be described by writing down the nodes and the edges. For example, this is a social network of people...
- Brandes U, Pich C (2007) Eigensolver methods for progressive multidimensional scaling of large data. In: Proceeding of the 14th international symposium graph drawing (GD’06). LNCS, vol 4372, pp 42–53Google Scholar
- Duncan CA, Goodrich MT (2013) Planar orthogonal and polyline drawing algorithms, chap 7. In: Tamassia R (ed) Handbook of graph drawing and visualization. CRC Press, Hoboken, pp 223–246Google Scholar
- Frishman Y, Tal A (2007) Online dynamic graph drawing. In: Proceeding of eurographics/IEEE VGTC symposium on visualization (EuroVis), pp 75–82Google Scholar
- Gansner ER, Koren Y, North SC (2004) Graph drawing by stress majorization. In: Proceeding of the 12th international symposium on graph drawing (GD’04). LNCS. vol 3383. Springer, pp 239–250Google Scholar
- Hachul S, Jünger M (2004) Drawing large graphs with a potential field based multilevel algorithm. In: Proceeding of the 12th international symposium graph drawing (GD’04). LNCS, vol 3383. Springer, pp 285–295Google Scholar
- Healy P, Nikolov NS (2014) Hierarchical drawing algorithms. In: Tamassia R (ed) Handbook of graph drawing and visualization, chap 13. CRC Press, Boca Raton, pp 409–454Google Scholar
- Hu Y (2005) Efficient and high quality force-directed graph drawing. Math J 10:37–71Google Scholar
- Kerren A, Purchase H, Ward MO (eds) (2014) Multivariate network visualization: Dagstuhl seminar # 13201, Dagstuhl Castle, 12–17 May 2013. Revised discussions, Lecture notes in computer science, vol 8380, Springer, ChamGoogle Scholar
- Kruskal JB, Seery JB (1980) Designing network diagrams. In: Proceedings of the first general conference on social graphics, U.S. Department of the Census, Washington, DC, pp 22–50, Bell laboratories technical report no. 49Google Scholar
- Moscovich T, Chevalier F, Henry N, Pietriga E, Fekete J (2009) Topology-aware navigation in large networks. In: CHI ’09: Proceedings of the 27th international conference on human factors in computing systems. ACM, New York, pp 2319–2328Google Scholar
- Ortmann M, Klimenta M, Brandes U (2016) A sparse stress model. In: Graph drawing and network visualization – 24th international symposium, GD 2016, Athens, revised selected papers, pp 18–32Google Scholar
- Purchase HC (1997) Which aesthetic has the greatest effect on human understanding? In: Proceeding of the 5th international symposium graph drawing (GD’97). LNCS. Springer, pp 248–261Google Scholar
- Quigley A (2001) Large scale relational information visualization, clustering, and abstraction. PhD thesis, Department of Computer Science and Software Engineering, University of NewcastleGoogle Scholar
- Rusu A (2013) Tree drawing algorithms. In: Tamassia R (ed) Handbook of graph drawing and visualization chap 5. CRC Press, Boca Raton, pp 155–192Google Scholar
- Tunkelang D (1999) A numerical optimization approach to general graph drawing. PhD thesis, Carnegie Mellon UniversityGoogle Scholar
- Vismara L (2013) Planar straight-line drawing algorithms. In: Tamassia R (ed) Handbook of graph drawing and visualization chap 6. CRC Press, Boca Raton, pp 193–222Google Scholar