Define what you understand by the subsequent terms in Network Flows:
i) UnDirected Path
ii) Directed Path
iii) Directed Cycle.
In each of the above, show the differentiations in terms of nodes and directions.
Make a distinction between Best Case and Worst Case complexity analysis. In each case give suitable instances.
Describe what you understand by the phrase Tree Decomposition.
Discuss how Lower Bounds on Arc Flows are eliminated. Show your workings by a mathematical representation or otherwise.
In brief describe the steps involved in Network Simplex Method.
What data structures you would anticipate in the Network Simplex Method. Indicate the data structures significance at each step.