Graph Theory & Applications 3 min read
Graph Theory – Matchings
A matching graph is a subgraph of a graph where there are no edges adjacent to each other. Simply, there…
THE ARTICLE LIBRARY
All stories.
Ideas and explainers from across SenseCentral.
Graph Theory & Applications 3 min read
Cut Set and Cut Vertex of Graph
Whether it is possible to traverse a graph from one vertex to another is determined by how a graph is…
Graph Theory & Applications 4 min read
Graph Theory – Coverings
A covering graph is a subgraph which contains either all the vertices or all the edges corresponding to some other…
Graph Theory & Applications 4 min read
Graph Theory – Connectivity
Whether it is possible to traverse a graph from one vertex to another is determined by how a graph is…
Graph Theory & Applications 3 min read
Graph Theory – Trees
Trees are graphs that do not contain even a single cycle. They represent hierarchical structure in a graphical form. Trees…
Graph Theory & Applications 9 min read
Graph Theory – Types of Graphs
There are various types of graphs depending upon the number of vertices, number of edges, interconnectivity, and their overall structure.…
Design & Analysis of Algorithms 15 min read
Maximum Matching in Bipartite Graphs
In many situations we are faced with a problem of pairing elements of two sets. The traditional example is boys…
Design & Analysis of Algorithms 26 min read
The Simplex Method
We have already encountered linear programming (see Section 6.6)—the general problem of optimizing a linear function of several variables subject…
Design & Analysis of Algorithms 3 min read
Iterative Improvement
The greedy strategy, considered in the preceding chapter, constructs a solution to an optimization problem piece by piece, always adding…
Design & Analysis of Algorithms 9 min read
Huffman Trees and Codes
Suppose we have to encode a text that comprises symbols from some n-symbol alphabet by assigning to each of the text’s…