Posted inProgramming & Data Structures
Posted inGraph Theory & Applications
Cut Set and Cut Vertex of Graph
Whether it is possible to traverse a graph from one vertex to another is determined…
Posted inGraph Theory & Applications
Graph Theory – Coverings
A covering graph is a subgraph which contains either all the vertices or all the…
Posted inGraph Theory & Applications
Graph Theory – Connectivity
Whether it is possible to traverse a graph from one vertex to another is determined…
Posted inGraph Theory & Applications
Graph Theory – Trees
Trees are graphs that do not contain even a single cycle. They represent hierarchical structure…
Posted inGraph Theory & Applications
Graph Theory – Types of Graphs
There are various types of graphs depending upon the number of vertices, number of edges,…
Posted inDesign & Analysis of Algorithms
Maximum Matching in Bipartite Graphs
In many situations we are faced with a problem of pairing elements of two sets.…
Posted inDesign & Analysis of Algorithms
The Simplex Method
We have already encountered linear programming (see Section 6.6)—the general problem of optimizing a linear…
Posted inDesign & Analysis of Algorithms
Iterative Improvement
The greedy strategy, considered in the preceding chapter, constructs a solution to an optimization problem…
Posted inDesign & Analysis of Algorithms
Huffman Trees and Codes
Suppose we have to encode a text that comprises symbols from some n-symbol alphabet by assigning…
Posted inDesign & Analysis of Algorithms
Dijkstra’s Algorithm
In this section, we consider the single-source shortest-paths problem: for a given vertex called the source in a…