Speaker: Surender Baswana, IIT Kanpur   Abstract: Mincuts are one of the most well-researched topics in algorithms. In recent years, there has been phenomenal research on algorithms for computing (s,… Read More »An amazing structure for representing all Steiner mincuts of a graph