# CARMA Short Course

*Graph Drawing*

## Monday, 5^{th} Feb 2018 — Friday, 23^{rd} Feb 2018

**V205, Mathematics Building**

This course, given by Peter Eades from the University of Sydney, is about geometric representations of graphs, and algorithms that take a graph as input and produce a visualization (aka drawing) of the graph as output. We discuss the quality of such visualizations of graphs from the human perceptual point of view.

The course discusses both small and large graphs. For small graphs, we examine algorithms
that use the concepts of topological graph theory. For large graphs, we examine methods
based on minimising energy in physical system, and well as methods based on spectral graph
theory.

• Download Subject information guide ("Graph Drawing") [/pdf/ACE_subject_guide-Graph_Drawing.pdf]