Graph Problems through the Lens of Communication Complexity
Programs & Events >

Graph Problems through the Lens of Communication Complexity

Speaker: Prof. Sagnik Mukhopadhyay (School of Computer Science, University of Birmingham, UK)

General
  • Date 10 June 2026
  • Location SSB 334, II Floor, Department of CSE
  • Time 3:00 PM

Abstract

We show a few communication protocols for solving fundamental graph problems such as minimum cut, vertex connectivity, and bipartite maximum matching. We also mention how these communication protocols help us come up with efficient algorithms for these problems in various other models of computation.

About the Speaker

Prof.Sagnik Mukhopadhyay is a faculty member in the School of Computer Science, University of Birmingham, United Kingdom. Prof. Mukhopadhyay’s research interests are in algorithms and complexity.