|
Hi everyone,
Apologies, we again have no seminar today. However next week (October 22), we will have Shyan Akmal from INSAIT (https://www.shyanakmal.com/)
speak at the seminar! Shyan is an expert in graph algorithms and fine grained complexity.
@Students, please also sign up to chat!
His talk details are below:
Details: Wed Oct 22 at 2:30pm - 3:30pm, Morgridge Hall 3610
Title: A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection
Abstract:
One of the most basic questions about detecting patterns in data is the Induced Subgraph Detection problem. Here we are given a small pattern graph and a large host graph, and are tasked with determining if the host contains
the pattern as an induced subgraph. One of the dream goals of fine-grained complexity and graph algorithms is to fully classify those patterns for which Induced Subgraph Detection is easy to solve, and those for which it becomes difficult. In this talk, we
present some recent, surprising progress on this classification question, centered around a particularly suspicious pattern known as the 4-cycle.
See you there!
Best,
Sandeep
|