Næsta málstofa verður þriðjudaginn 25. apríl kl 13:20 í Naustinu, húsi Endurmenntunar.
Fyrirlesari er Gabor Elek, Lancaster University.
Titill fyrirlestrarins er Very fast graph algorithms.
Ágrip: Interesting graph parameters are very hard to compute, that is, the known computation algorithms run in exponential times. Unfortunately, we don’t have that much time…. However, for certain important graph classes there are very fast algorithms to compute basically all graph parameters if one is ready to make some quite reasonable compromises. I will talk about these very fast algorithms and the theory behind them.