Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
we have m communication terminals each to be connected to one out of a given collection of concentrators suppose that
consider a graph and the question whether there exists a forward cycle that passes through each arc of the graph
consider the graph and the flow vector of fig 116a enumerate the simple paths and the simple forward paths that start
consider a graph such that each of the nodes has even degree a give an algorithm to decompose the graph into a
consider the minimum cost flow problem with the additional constraints that the total flow of the outgoing arcs from
consider an n times n chessboard with n ge 4 show that a knight starting at any square can visit every other square
a consider an n times n chessboard and a rook that is allowed to make the standard moves along the rows and columns
in the graph of fig 116 consider the graph obtained by deleting node 1 and arcs 1 2 1 3 and 5 4 decompose this graph
a devise an algorithm with oa running time that checks whether the graph is connected and if it is connected
consider a volleyball net that consists of a mesh with m squares on the horizontal dimension and n squares on the
shortest path problems with losses consider a vehicle routingshortest path-like problem where a vehicle wants to go on
consider the one origin-all destinations problem and the generic algorithm of section 22 assume that there exists a
apply the forwardreverse auction algorithm to the example of fig 213 and show that it terminates in a number of
forward dynamic programming given a problem of finding a shortest path from node s to node t we can obtain an
shortest path problems with negative cycles consider the problem of finding a simple forward path between an origin and
path bottleneck problem consider the framework of the shortest path problem for any path p define the bottleneck arc of
we have a set of n objects 1n arranged in a given order we want to group these objects in clusters that contain
the purpose of this exercise due to shier 1979 and guerriero lacagnina musmanno and pecorella 1997 is to introduce an
k shortest node-disjoint paths the purpose of this exercise due to castatildenon 1990 is to formulate a class of
extension for the case of zero length cycles extend the auction algorithm for the case where all arcs have nonnegative
minimum weight spanning trees given a graph n a and a weight wij for each arc i j consider the problem of finding a
label correcting for acyclic graphs consider the problem of finding shortest paths from the origin node 1 to all
describe an algorithm of the ford-fulkerson type for checking the feasibility and finding a feasible solution of a
consider the graph of fig 214 find a shortest path from 1 to all nodes using the binary heap method dials algorithm the
consider the problem of finding a shortest path from the origin 1 to a single destination t subject to the constraint