Final Activity Report Summary - PHASETRANS (Phase transitions in computational complexity and formal verification: towards generic and realistic approaches)
We developed mathematical methods (based on concepts from Statistical Physics) to analyse the performance of several existing algorithms from the literature, and developed new ones. We studied the applicability of such methods to problems of practical impact such as dividing a network into two equal parts while cutting the minimum number of links (a problem that appears in parallel computing) and in problems of grouping a set of items into clusters in the most natural way (an approach from data analysis and mining known as correlation clustering).