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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic Book Chapter |
| Language: | English |
| Published: |
Berlin
Universitätsverlag der Technischen Universität Berlin
2021
|
| Series: | Foundations of computing
14 |
| Subjects: | |
| Online Access: | OAPEN Library: download the publication OAPEN Library: description of the publication |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|