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...
I tiakina i:
Kaituhi matua: | Bentert, Matthias (auth) |
---|---|
Hōputu: | Tāhiko Wāhanga pukapuka |
Reo: | Ingarihi |
I whakaputaina: |
Berlin
Universitätsverlag der Technischen Universität Berlin
2021
|
Rangatū: | Foundations of computing
14 |
Ngā marau: | |
Urunga tuihono: | OAPEN Library: download the publication OAPEN Library: description of the publication |
Ngā Tūtohu: |
Tāpirihia he Tūtohu
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|
Ngā tūemi rite
-
Elements of dynamic and 2-SAT programming: paths, trees, and cuts
mā: Bentert, Matthias
I whakaputaina: (2021) -
Paths Why is life filled with so many detours?
mā: Gulyás, András
I whakaputaina: (2021) -
Paths Why is life filled with so many detours?
mā: Gulyás, András
I whakaputaina: (2021) -
Information flow control for java : a comprehensive approach based on path conditions in dependence Graphs
mā: Hammer, Christian
I whakaputaina: (2009) -
Graph Algorithms and Applications
I whakaputaina: (2022)