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...
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Elettronico Capitolo di libro |
| Lingua: | inglese |
| Pubblicazione: |
Berlin
Universitätsverlag der Technischen Universität Berlin
2021
|
| Serie: | Foundations of computing
|
| Soggetti: | |
| Accesso online: | DOAB: download the publication DOAB: description of the publication |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
Accesso online
DOAB: download the publicationDOAB: description of the publication
3rd Floor Main Library
| Collocazione: |
A1234.567 |
|---|---|
| Copia 1 | Disponibile |