Kapak Resmi

Elements of dynamic and 2-SAT programming: paths, trees, and cuts

Diğer sürümleri göster (1)

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...

Ful tanımlama

Kaydedildi:
Detaylı Bibliyografya
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:
Algorithms & data structures
graph diameter
shortest paths computation
flow and cut problems
resource allocation
computational biology
Online Erişim:DOAB: download the publication
DOAB: description of the publication
Etiketler: Etiketle
Etiket eklenmemiş, İlk siz ekleyin!

Internet

DOAB: download the publication
DOAB: description of the publication

3rd Floor Main Library

Detaylı Erişim Bilgileri 3rd Floor Main Library
Yer Numarası: A1234.567
Kopya Bilgisi 1 Kütüphanede

Benzer Materyaller