000 00492nam a2200121Ia 4500
008 220615s9999||||xx |||||||||||||| ||und||
100 _aBentert, Matthias
245 0 _aElements of dynamic and 2-SAT programming: paths, trees, and cuts
546 _aEnglish[eng]
650 _agraph diameter||shortest paths computation||flow and cut problems||resource allocation||computational biology
856 _uhttps://library.oapen.org/bitstream/20.500.12657/54061/1/bentert_matthias.pdf
942 _cEB
999 _c10161
_d10161