Finding a heaviest triangle is not harder than matrix multiplication

Artur Czumaj, Andrzej Lingas. Finding a heaviest triangle is not harder than matrix multiplication. In Nikhil Bansal, Kirk Pruhs, Clifford Stein, editors, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007. pages 986-994, SIAM, 2007. [doi]

Abstract

Abstract is missing.