The School of Computing and Mathematical Sciences, Algorithms Group Seminar.
When:
—
Venue:
Birkbeck Main Building, Malet Street
Sparse graphs offer us a variety of useful tools that enable us to design more efficient algorithms. Here I will survey various techniques that arise from the "bounded expansion" toolkit and showcase examples of their use. I will keep the talk approachable and would love to discuss potential applications in other areas with the audience. Attend if you are curious whether the sparse graphs toolkit might be something that is useful in your own research!
Contact name:
Oded Lachish