You are now in the main content area
Graph property testing
- Date
- November 26, 2025
- Time
- 11:10 AM EST - 12:00 PM EST
- Location
- ENG-210 and virtually via zoom
- Open To
- All faculty, staff, students and guests are welcome to attend
- Contact
- Pawel Pralat (pralat@torontomu.ca)
Speaker: Lior Gishboliner, University of Toronto
Title: Graph property testing
Abstract: Property testing studies the existence of fast ``election polling'' algorithms for distinguishing inputs (graphs) having a certain property from inputs which are far from the property. I will give an overview of the subject, focusing on the question of testing with polynomial sample complexity and presenting some results from recent years.