TU Wien:Diskrete Mathematik für Informatik VO (Gittenberger)/Schriftliche Prüfung 2018-01-31

Aus VoWi
Zur Navigation springen Zur Suche springen

1. Given a graph and a flow (as weight matrix), find: value of the flow, augmenting paths (one with only forward edges, another with at least one backward edge), minimal cut, maximal flow.

2. Determine µ(0,1) for a given partial order (it was given as Hasse diagram).

3. Let R be an integral domain. Prove .

4. Given a word (?). Is there a cyclic linear code such that ?