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: | Bentert, Matthias (auth) |
---|---|
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!
|
Benzer Materyaller
-
Elements of dynamic and 2-SAT programming: paths, trees, and cuts
Yazar:: Bentert, Matthias
Baskı/Yayın Bilgisi: (2021) -
Paths Why is life filled with so many detours?
Yazar:: Gulyás, András
Baskı/Yayın Bilgisi: (2021) -
Paths Why is life filled with so many detours?
Yazar:: Gulyás, András
Baskı/Yayın Bilgisi: (2021) -
Information flow control for java : a comprehensive approach based on path conditions in dependence Graphs
Yazar:: Hammer, Christian
Baskı/Yayın Bilgisi: (2009) -
Graph Algorithms and Applications
Baskı/Yayın Bilgisi: (2022)