PACM Colloquium

PACM Colloquium: Assaf Naor, Mathematics - Princeton University

*This event is in-person and open only to Princeton University ID holders

All attendees must be masked upon entry.

Randomized clustering in high dimensions

Abstract: The separation modulus of a metric space M is the smallest S>0 such that for every D>0 there exists a random partition of M into clusters of diameter at most D such that for any two points in M the probability that they belong to different clusters is at most their distance times (S/D).

PACM Colloquium: Maria Chudnovsky, Mathematics - Princeton University

*This event is in-person and open only to Princeton University ID holders

Induced subgraphs and tree decompositions

Abstract: Tree decompositions are a powerful tool in both structural graph theory and graph algorithms. Many hard problems become tractable if the input graph is known to have a tree decomposition of bounded “width”. Exhibiting a particular kind of a tree decomposition is also a useful way to describe the structure of a graph.

Pages

Subscribe to RSS - PACM Colloquium