104
click to vote
ECCC
2006
15 years 2 months ago
2006
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 ...