Mittagsseminar (in cooperation with J. Lengler, A. Steger, and D. Steurer)

Date and Time: Thursday, February 28, 2013, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Pascal Schweitzer

Aspects of the Graph Isomorphism Problem

The graph isomorphism problem asks whether there is an adjacency and non-adjacency preserving bijection between the vertices of two input graphs. The problem lies in the complexity class NP, but neither is the problem known to be NP-complete nor has a polynomial-time algorithm been developed. Its complexity status thus remains open. I will talk about some algorithmic aspects of the graph isomorphism problem: To this end I will give an overview over the reoccurring techniques and classical results. I will then describe more recent results and talk about graph isomorphism in the context of random graph classes.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2025  2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login