Elements of dynamic and 2-SAT programming: paths, trees, and cuts
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...
| Format: | eBook |
|---|---|
| Language: | English |
| Published: |
Berlin
Universitätsverlag der Technischen Universität Berlin
2021
|
| Series: | Foundations of computing
|
| Subjects: | |
| Online Access: | Open Access: DOAB: description of the publication Open Access: DOAB, download the publication |