Graph partitioning and bisection represent fundamental questions in combinatorial optimisation, concerned with dividing the vertices of a graph into disjoint subsets while balancing size constraints ...

Spectral graph theory examines the structural and dynamical properties of graphs by analysing the spectra of associated matrices such as the adjacency matrix, Laplacian, normalised Laplacian and ...

Spectral clustering is quite complex, but it can reveal patterns in data that aren't revealed by other clustering techniques. Data clustering is the process of grouping data items so that similar ...