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...
Kaydedildi:
| Yazar: | |
|---|---|
| Materyal Türü: | Elektronik Kitap Bölümü |
| Dil: | İngilizce |
| Baskı/Yayın Bilgisi: |
Berlin
Universitätsverlag der Technischen Universität Berlin
2021
|
| Seri Bilgileri: | Foundations of computing
14 |
| Konular: | |
| Online Erişim: | OAPEN Library: download the publication OAPEN Library: description of the publication |
| Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|
Search Result 1
DOAB: description of the publication
Elements of dynamic and 2-SAT programming: paths, trees, and cuts
Baskı/Yayın Bilgisi 2021
DOAB: download the publication
DOAB: description of the publication
Elektronik
Kitap Bölümü