Normal view MARC view ISBD view

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

Bentert, Matthias

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

English[eng]

Subjects--Topical Terms:
graph diameter||shortest paths computation||flow and cut problems||resource allocation||computational biology

Place hold
Print
Add to your cart (remove)
Send to device
Save record
BIBTEX Dublin Core ISBD MARC (non-Unicode/MARC-8) RIS
More searches

Search for this title in:
Goodreads Google Books Amazon India Kerala Academic Library Network (Union Catalog)