Graph Partitioning

Use of algebraic methods and semidefinite optimization to obtain approximation algorithms and bounds for NP-hard graph partitioning problems, in particular coloring and conductance. FAPEMIG project “Spectrum of graphs and quantum models of clustering” in international cooperation with researchers Aida Abiad (Eindhoven University of Technology) and Krystal Guo (University of Amsterdam).