(Georgia Institute of Technology, 2010-10-01)
Bhowmick, Sanjukta
Force-directed graph embedding algorithms, like the Fruchterman-Reingold method, are typically used to generate aesthetically pleasing graph layouts. At a
fundamental level, these algorithms are based on manipulating the structural
properties of the graph to match them to certain spatial requirements. This
relation between structural and spatial properties is also present in other areas
beyond graph visualization. In this talk, I will discuss how graph embedding can be
used in diverse areas such as (i) improving the accuracy of unsupervised
clustering, (ii) creating good quality elements in unstructured meshes and (iii)
identifying perturbations in large-scale networks.