Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Solved Assignments
Asked Questions
Answered Questions
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
can we modify dijkstras algorithm to solve the single-source longest path problem by changing minimum to maximum if so
1 let g ve be a weighted acyclic directed graph with possibly negative edge weights design a linear-time algorithm to
let g ve be a directed weighted graph such that all the weights are positive let v and w be two vertices in g and k le
a derangement is a permutation p of 1n such that no item is in its proper position ie pi ne i for all 1 le i le n write
anagrams are rearrangements of the letters of a word or phrase into a different word or phrase sometimes the results
in the turnpike reconstruction problem you are given nn - 12 distances in sorted order the problem is to find the
1 implement an efficient algorithm for listing all k-element subsets of n items2 an anagram is a rearrangement of the
use a random number generator rng04 that generates numbers from 0 1 2 3 4 with equal probability to write a random
suppose you are given three strings of characters x y and z where x n y m and z n m z is said to be a shuffle of
in the united states coins are minted with denominations of 1 5 10 25 and 50 cents now consider a country whose coins
in the single-processor scheduling problem we are given a set of n jobs j each job i has a processing time ti and a
the longest common subsequence lcs of two sequences t and p is the longest sequence l such that l is a subsequence of
you start with an empty room and a group of n people waiting outside at each step you may either admit one person into
consider the following data compression technique we have a table of m text strings each at most k in length we want to
the traditional world chess championship is a match of 24 games the current champion retains the title in case the
consider a city whose streets are defined by an x timesy grid we are interested in walking from the upper left-hand
consider the same situation as the previous problem we have a city whose streets are defined by an x times y grid we
consider the problem of storing n books on shelves in a library the order of the books is fixed by the cataloging