Finding heaviest H-subgraphs in real weighted graphs, with applications

Virginia Vassilevska, Ryan Williams, Raphael Yuster

For a graph G with real weights assigned to the vertices (edges), the MAX H-SUBGRAPH problem is to find an H-subgraph of G with maximum total weight, if one exists. The all-pairs M…