Title: Two theoretical topics in clustering

Dan Gusfield is Professor of Computer Science at UC Davis.

Date of Talk: Sep 12, 2022

Recommended Reading:

a) Notes on Kleinberg’s Impossibility Theorem are from “Proven Impossible: Elementary Proofs of Profound Impossibility from

Arrow, Bell, Chaitin, Godel, Turing, and more” by Dan Gusfield, to be published by Cambridge University Press.

b) Notes on modularity are from “Integer Linear Programming in Computational Biology” by Dan Gusfield published by Cambridge University Press.