We use cookies on this site. By browsing our site you agree to our use of cookies. Close this message Find out more

Home > Computer Science home > Events > Seminar Dr. Danupon Nanongkai
More in this section Events articles

Seminar Dr. Danupon Nanongkai

15/05/2017 (14:00-15:00)

Danupon Nanongkai

Dr. Danupon Nanongkai, KTH Royal Institute of Technology, Stockholm

A survey on dynamic graph algorithms and complexity

In this talk I will survey exciting past progresses and future opportunities in developing algorithms and complexity theory for dynamic graph problems. I will discuss barriers and intermediate steps in resolving some of the central graph problems in the area, such as connectivity, minimum spanning tree, shortest paths and maximum matching, I will also discuss how ideas and techniques from other areas -- such as spectral method, sketching, algebraic techniques, primal/dual method, and distributed/parallel algorithms -- came into play in developing dynamic graph algorithms.


Comment on this page

Did you find the information you were looking for? Is there a broken link or content that needs updating? Let us know so we can improve the page.

Note: If you need further information or have a question that cannot be satisfied by this page, please call our switchboard on +44 (0)1784 434455.

This window will close when you submit your comment.

Add Your Feedback