Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
1 design a stack that supports push pop and retrieving the minimum element in constant time can you do this2 you are
1 give a linear algorithm to compute the chromatic number of graphs where each vertex has degree at most 2 must such
your job is to arrange n ill-behaved children in a straight line facing front you are given a list of m statements of
adding a single directed edge to a directed graph can reduce the number of weakly connected components but by at most
consider a set of movies m1 m2mk there is a set of customers each one of which indicates the two movies they would like
the diameter of a tree t ve is given bywhere deltau v is the number of edges on the path from u to v describe an
design a linear-time algorithm to eliminate each vertex v of degree 2 from a graph by replacing edges u v and vw by an
let v and w be two vertices in a directed graph g ve design a lineartime algorithm to find the number of different
a vertex cover of a graph g ve is a subset of vertices v isin v such that every edge in e contains at least one vertex
a vertex cover of a graph g ve is a subset of vertices v such that each edge in e is incident on at least one vertex
present correct and efficient algorithms to convert an undirected graph g between the following graph data structures
given pre-order and in-order traversals of a binary tree is it possible to reconstruct the tree if so sketch an
in breadth-first and depth-first search an undiscovered node is marked discovered when it is first encountered and
answer all of the followinga give an example of a weighted connected graph g ve and a vertex v such that the minimum
devise an efficient data structure to handle the following operations on a weighted directed grapha merge two given
let g ve be an undirected graph a set f sube e of edges is called a feedback-edge set if every cycle of g has at least
consider the problem of finding a minimum weight connected subset t of edges from a weighted connected graph g the
a let t be a minimum spanning tree of a weighted graph g construct a new graph g by adding a weight of k to every edge
suppose we are given the minimum spanning tree t of a given graph g with n vertices and m edges and a new edge e u v
for the graphs in problem 5-1a draw the spanning forest after every iteration of the main loop in kruskals algorithmb
an articulation vertex of a graph g is a vertex whose deletion disconnects g let g be a graph with n vertices and m
an edge cover of an undirected graph g ve is a set of edges such that each vertex in the graph is incident to at least
in certain graph problems vertices have can have weights instead of or in addition to the weights of edges let cv be
design and implement an algorithm for solving the subgraph isomorphism problem given graphs g and h does there exist a