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…
Dijkstra’s Algorithm
In this section, we consider the single-source shortest-paths problem: for a given vertex…
Prim’s Algorithm
The following problem arises naturally in many practical situations: given n points, connect them…
Greedy Technique
Let us revisit the change-making problem faced, at least subconsciously, by millions of cashiers…
The Knapsack Problem and Memory Functions
We start this section with designing a dynamic programming algorithm for the…
