기초과학연구원 이산수학그룹
On April 28, 2025, Pascal Schweitzer from the Technical University of Darmstadt gave a talk on finding symmetries and deciding isomorphic graphs at the Discrete Math Seminar. The title of his talk was “Recent insights surrounding combinatorial approaches to isomorphism and symmetry problems“.
Modern practical software libraries that are designed for isomorphism tests and symmetry computation rely on combinatorial techniques combined with techniques from algorithmic group theory. The Weisfeiler-Leman algorithm is such a combinatorial technique. When taking a certain view from descriptive complexity theory, the algorithm is universal. After an introduction to problems arising in symmetry computation and this particular combinatorial technique, I will give an overview of results from recent years. The results give insights into worst-case behavior and computational complexity.