ACO Seminar - Bernardo Subercaseaux Wean Hall 8220 Anonymous (not verified) Mon, 02/02/2026 - 16:38 In Person
Breaking down graphs and hypergraphs into structured pieces, optimally and efficiently
BERNARDO SUBERCSEAUX We will consider the problem of writing an arbitrary graph as an edge-disjoint union of complete bipartite graphs, and its natural generalization to hypergraphs. At a very high level, the question at hand is to what extent we can summarize comp