bentert_matthias.pdf
This thesis presents faster (in terms of worst-case running times) exact algorithms for special cases of graph problems through dynamic programming and 2-SAT programming. Dynamic programming describes the procedure of breaking down a problem recursively into overlapping subproblems, that is, subprob...
| Γλώσσα: | English |
|---|---|
| Έκδοση: |
Universitätsverlag der Technischen Universität Berlin
2022
|
| Διαθέσιμο Online: | https://verlag.tu-berlin.de/produkt/978-3-7983-3209-6/ |
