University of Birmingham > Talks@bham > Reading Group in Combinatorics and Probability > Dynamic programming using a tree decomposition

Dynamic programming using a tree decomposition

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

If you have a question about this talk, please contact Felix Joos.

We will investigate algorithmic consequences of the graph minor project.

This talk is part of the Reading Group in Combinatorics and Probability series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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