University of Birmingham > Talks@bham > Study group in Graph Theory, Topology and Algorithms > Fine-Grained (FPT) Algorithms for Problems on Planar graphs

  Browse A-Z

Log in

System Admin (disabled)details Birmingham usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

Fine-Grained (FPT) Algorithms for Problems on Planar graphs

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Johannes Carmesin.

In the first half of this talk I will describe how the paradigm of fixed-parameter tractable (FPT) algorithms allows us to make a refined analysis of running time of algorithms for (graph) problems. In the second half, I will focus on the particular case of planar graphs and describe some recent results & techniques in this area.

No background will be assumed, other than an undergraduate-level familiarity with graph theory and algorithms+complexity.

This talk is part of the Study group in Graph Theory, Topology and Algorithms series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Astrophysics Talks Series Cond. Mat. seminar Medical Imaging Research Seminars

Other talks

Geometry of alternating projections in metric spaces with bounded curvature Quantum simulations using ultra cold ytterbium TBC Modelling uncertainty in image analysis. Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Extending the Lax type operator for finite W-algebras
 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.