BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Faster Symmetry Discovery using Sparsity of Symmetries  
DTSTART:20090626T141500
DTSTAMP:20260506T080355Z
UID:c5e2d0b7fb6431b27ef7189eb8364bcf67a7583614078bf1ec2e2982
CATEGORIES:Conferences - Seminars
DESCRIPTION:Prof. Karem Sakallah\, University of Michigan\nMany computatio
 nal tools have recently begun to benefit from the use of the symmetry inhe
 rent in the tasks they solve\, and use general-purpose graph symmetry tool
 s to uncover this symmetry. However\, existing tools suffer quadratic runt
 ime in the number of symmetries explicitly returned and are of limited use
  on very large\, sparse\, symmetric graphs. This paper introduces a new sy
 mmetry-discovery algorithm which exploits the sparsity present not only in
  the input but also the output\, i.e.\, the symmetries themselves. By avoi
 ding quadratic runtime on large graphs\, it improves state-of the-art runt
 imes from several days to less than a second. \nProf. Sakallah's homepage
LOCATION:BC 01 https://plan.epfl.ch/?room==BC%2001
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR