No title
We show that for any 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time \O(n+n2+), where is the exponent of fastest matrix multiplication algorithm. By the currently best bound on , the running time of our algorithm is \O(n2376). Our algorithm substantially improves the previous time-bounds for this problem recently establ
