Graph Theory – Independent Sets
Independent sets are represented in sets, in which · there should not be any…
Cut Set and Cut Vertex of Graph
Whether it is possible to traverse a graph from one vertex to…
Graph Theory – Coverings
A covering graph is a subgraph which contains either all the vertices…
Graph Theory – Connectivity
Whether it is possible to traverse a graph from one vertex to…
Graph Theory – Types of Graphs
There are various types of graphs depending upon the number of vertices,…
Maximum Matching in Bipartite Graphs
In many situations we are faced with a problem of pairing elements…
The Simplex Method
We have already encountered linear programming (see Section 6.6)—the general problem of…
Iterative Improvement
The greedy strategy, considered in the preceding chapter, constructs a solution to…


