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

  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

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.

Other lists

Cargo EPS - College Research Teas Human Computer Interaction seminars

Other talks

The tragic destiny of Mileva Marić Einstein Life : it’s out there, but what and why ? TBA Waveform modelling and the importance of multipole asymmetry in Gravitational Wave astronomy TBA TBC
 

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.