Circle T(rue) or F(alse). T F (a) integer capacity ce on every edge e. If f is a maximum s – edge out of s with flow (i.e., for all edges e out of s, we have f(e) = ce). Let G be an arbitrary flow network, with a source s, a sink t, and a positive t flow in G, then f saturates every (b) Then it is possible that the residual graph contains (v, u), but not (u, v). T F Let (u, v) be an edge in a maximum flow graph with capacity greater than 0.

Circle T(rue) or F(alse). T F (a) integer capacity ce on every edge e. If f is a maximum s – edge out of s with flow (i.e., for all edges e out of s, we have f(e) = ce). Let G be an arbitrary flow network, with a source s, a sink t, and a positive t flow in G, then f saturates every (b) Then it is possible that the residual graph contains (v, u), but not (u, v). T F Let (u, v) be an edge in a maximum flow graph with capacity greater than 0.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

How many different onto functions f: S→ T can be defined that map the domain S = {1, 2, 3,..., 10} to the range T = {11, 12, 13,..., 20}? Enter your answer in the box below. Answer =
Let f be a flow of flow network G and f' a flow of residual network Gf . Show that f +f' is a flow of G.
Consider eight points on the Cartesian two-dimensional x-y plane. a g C For each pair of vertices u and v, the weight of edge uv is the Euclidean (Pythagorean) distance between those two points. For example, dist(a, h) : V4? + 1? = /17 and dist(a, b) = v2? + 0² = 2. Because many pairs of points have identical distances (e.g. dist(h, c) V5), the above diagram has more than one minimum-weight spanning tree. dist(h, b) = dist(h, f) Determine the total number of minimum-weight spanning trees that exist in the above diagram. Clearly justify your answer.
Apply the Network flow maximization algorithm in the text book to the network below one step at a time. At each step, show diagrams of the flow graph Gf and the residual graph Gr to each diagram to describe how you obtained it from the previous diagram. In particular, describe the policy used to select an augmenting path from s to t for adding to the flow graph when multiple options were available. What is the termination condition for your algorithm? Prove that your solution is correct
g) Show the residual graph for the network flow given in answer to part (c). What is the bottleneck edge of the path (?, ?2, ?3, ?1, ?4, ?) in the residual graph you have given in answer to part (g) ? Show the network with the flow that results from augmenting the flow based on the path (?, ?2, ?3, ?1, ?4, ?) of the residual graph you have given in answer to part (g).
in a graph G = (N,E,C), where N are nodes, E edges between nodes, and the weight of an edge e ∈ E is given by C(e), where C(e) > 1, for all e ∈ E. the heuristic h that counts the least amount of edges from an initial state to a goal state. now removing edges from the graph, while keeping the heuristic values unchanged. Is the heuristic still consistent?
Suppose you are given a directed graph G = (V, E) with a positive integer capacity ?? on each edge e, a designated source s ∈ V, and a designated sink t ∈ V. You are also given an integer maximum s-t flow value ?? on each edge e. Now suppose we pick a specific edge e belongs E and increase its capacity by one unit. Show how to find a maximum flow in the resulting capacitated graph in O(m + n), where m is the number of edges in G and n is the number on nodes.
Let f be an s,t-flow in an s, t-network D = (V, A) with capacities c : A → R>o, and assume that there is no augmenting path. Let X be the set of vertices that can be reached from s by unsaturated paths. Let (a, b) E A(X,V\ X). Explain why f(a,b) = c(a, b).
Prove that there exists a maximum flow f in G, such that the set of edges carrying positive flowis acyclic. In other words, f has the property that for every directed cycle in G made up of edgese1, e2, . . . , ek, at least one of the values f (e1), f (e2), . . . , f (ek) is equal to zero.
Need help with bottleneck flow problem
give set of R(x): x < x^2 where the domain is Z
Let G = (V, E) be a flow network with source s and sink t. We say that an edge e is a bottleneck if it crosses every minimum-capacity cut separating s from t. Give an eﬀicient algorithm to determine if a given edge e is a bottleneck in G. Analyze the running time of your algorithm.