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
|
Konular: | |
Online Erişim: | DOAB: download the publication DOAB: description of the publication |
Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|
Internet
DOAB: download the publicationDOAB: description of the publication
3rd Floor Main Library
Yer Numarası: |
A1234.567 |
---|---|
Kopya Bilgisi 1 | Kütüphanede |