Cover Image

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

Show other versions (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...

Full description

Saved in:
Bibliographic Details
Main Author: Bentert, Matthias (auth)
Format: Electronic Book Chapter
Language:English
Published: Berlin Universitätsverlag der Technischen Universität Berlin 2021
Series:Foundations of computing
Subjects:
Algorithms & data structures
graph diameter
shortest paths computation
flow and cut problems
resource allocation
computational biology
Online Access:DOAB: download the publication
DOAB: description of the publication
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

DOAB: download the publication
DOAB: description of the publication

3rd Floor Main Library

Holdings details from 3rd Floor Main Library
Call Number: A1234.567
Copy 1 Available

Similar Items