# Category Archives: Graph

We introduced graph coloring and applications in previous post. As discussed in the previous post, graph coloring is widely used. Unfortunately, there is no efficientâ€¦ Read More
Graph coloring problem is to assign colors to certain elements of a graph subject to certain constraints.  Vertex coloring is the most common graph coloringâ€¦ Read More
The problem is to find the shortest paths between every pair of vertices in a given weighted directed Graph and weights may be negative. Weâ€¦ Read More
We introduced Travelling Salesman Problem and discussed Naive and Dynamic Programming Solutions for the problem in the previous post,. Both of the solutions are infeasible.â€¦ Read More
Travelling Salesman Problem (TSP):  Given a set of cities and the distance between every pair of cities, the problem is to find the shortestâ€¦ Read More
Given an undirected graph, The task is to check if there is a cycle in the given graph. Example: Input: N = 4, E =â€¦ Read More
Given a directed graph and two vertices in it, source ‘s’ and destination ‘t’, find out the maximum number of edge disjoint paths from sâ€¦ Read More
Given a Weighted Directed Acyclic Graph (DAG) and a source vertex s in it, find the longest distances from s to all other verticesâ€¦ Read More
Eulerian Path is a path in a graph that visits every edge exactly once. Eulerian Circuit is an Eulerian Path that starts and ends on theâ€¦ Read More
The Stable Marriage Problem states that given N men and N women, where each person has ranked all members of the opposite sex in orderâ€¦ Read More
In a flow network, an s-t cut is a cut that requires the source ‘s’ and the sink ‘t’ to be in different subsets, andâ€¦ Read More
A matching in a Bipartite Graph is a set of the edges chosen in such a way that no two edges share an endpoint. Aâ€¦ Read More
Given a graph which represents a flow network where every edge has a capacity. Also given two vertices source ‘s’ and sink ‘t’ in theâ€¦ Read More
Eulerian Path is a path in a graph that visits every edge exactly once. Eulerian Circuit is an Eulerian Path that starts and ends onâ€¦ Read More
Given a directed graph, find out whether the graph is strongly connected or not. A directed graph is strongly connected if there is a pathâ€¦ Read More