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

Descripció completa

Dades bibliogràfiques

Autor principal:	Bentert, Matthias
Format:	Online
Idioma:	anglès
Publicat:	Universitätsverlag der Technischen Universität Berlin 2022
Matèries:	graph diameter shortest paths computation flow and cut problems resource allocation computational biology thema EDItEUR::U Computing and Information Technology::UM Computer programming / software engineering::UMB Algorithms and data structures
Accés en línia:	ONIX_20220415_9783798332096_2
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!