📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Finding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix Multiplication (2009)

First Author: Czumaj A

Attributed to: The Centre for Discrete Mathematics and its Applications (DIMAP) funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1137/070695149

Publication URI: http://dx.doi.org/10.1137/070695149

Type: Journal Article/Review

Parent Publication: SIAM Journal on Computing

Issue: 2