TU Wien:Diskrete Mathematik für Informatik VO (Gittenberger)/Mündliche Prüfung 08.06.2012

Aus VoWi
Zur Navigation springen Zur Suche springen
  • flows, definitions, algorithm
    • does ford-fulkerson always terminate? (yes)
    • is the result always correct/maximal? (no: in general when we use rational numbers for edge weights, it can happen, that ff retrieves a result which is not optimal. But since computers have finite representations of rational numbers, this is not important in real implementations)
  • linear codes
  • generating functions, combinatorial constructions
    • what is the relation between them?