An amazing structure for representing all Steiner mincuts of a graph
Bharti 501 IIT Campus, Hauz Khas, New DelhiSpeaker: 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, t)-mincuts and global mincuts. On the other hand, the data structural and graph theoretical aspects of mincuts have also been well-researched in the last 50… Read More »An amazing structure for representing all Steiner mincuts of a graph