problem 1:

Define what you understand by the subsequent terms in Network Flows:

i) UnDirected Path

ii) Directed Path

iii) Directed Cycle.

iv) Tree

In each of the above, show the differentiations in terms of nodes and directions.

problem 2:

Make a distinction between Best Case and Worst Case complexity analysis. In each case give suitable instances.

problem 3:

Describe what you understand by the phrase Tree Decomposition.

problem 4:

Discuss how Lower Bounds on Arc Flows are eliminated. Show your workings by a mathematical representation or otherwise.

problem 5:

In brief describe the steps involved in Network Simplex Method.

problem 6:

What data structures you would anticipate in the Network Simplex Method. Indicate the data structures significance at each step.