Spectral Graph Partitioning

Please enable javascript in your browser.

Behjati, Shahab | 2011

2091 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 41644 (02)
University: Sharif University of Tecnology
Department: Mathematical Sciences
Advisor(s): Daneshgar, Amir
Abstract:
Graph partitioning, or graph clustering, is an essential researa problem in many areas. In this thesis, we focus on the partitioning problem of unweighted undirected graph, that is, graphs for which the weight of all edges is 1. We will investigate spectral methods for solving the graph partitioning and we compare them. In addition to theoretical analysis,We also implement some of spectral algorithms in matlab and apply them on standard graph data sets. Finally, the experimental
results obtained are offering
Keywords:
Clustering ; Spectral Clustering ; Graph Partitioning ; Graph Clustering ; Spectral Graph Partitioning ; Graph Laplacian