![]() |
![]() |
University of Birmingham > Talks@bham > Study group in Graph Theory, Topology and Algorithms > Fine-Grained (FPT) Algorithms for Problems on Planar graphs
![]() Fine-Grained (FPT) Algorithms for Problems on Planar graphsAdd 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. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsComputer Science Distinguished Seminar Theoretical Physics Journal Club and Group Meeting Type the title of a new list hereOther talksWave turbulence in the Schrödinger-Helmholtz equation Ultrafast Spectroscopy and Microscopy as probes of Energy Materials TBA TBC Quantum Sensing in Space TBA |