3. Suppose we are given a directed acyclic graph G with a unique source s and a unique sink t. A vertex v {s, t} is called an (s, t)-cut vertex if every path froms to t passes through v, or equivalently, if deleting v makes t unreachable from s. Describe and analyze an algorithm to find every (s, t)-cut vertex in G. Figure 6.20. A directed acyclic graph with three (s, t)-cut vertices.

3. Suppose we are given a directed acyclic graph G with a unique source s and a unique sink t. A vertex v {s, t} is called an (s, t)-cut vertex if every path froms to t passes through v, or equivalently, if deleting v makes t unreachable from s. Describe and analyze an algorithm to find every (s, t)-cut vertex in G. Figure 6.20. A directed acyclic graph with three (s, t)-cut vertices.

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

Consider a graph with nodes and directed edges and let an edge from node a to node b berepresented by a fact edge (a,b). Define a binary predicate path that is true for nodes c and dif, and only if, there is a path from c to d in the graph.
Let G be a graph with n vertices. If the maximum size of an independent set in G is k, clearly explain why the minimum size of a vertex cover in G is n - k.
........
Algorithms
Let G be a undirected connected graph where the cost/length of every edge is 1 unit. Let s, tı, t2 be three distinct nodes. Describe shortly and in natural language (English) an O(m) algorithm that finds a node u such that the distance of u from s is as large as possible, but the length of any path from s to tį and from s to t2 that contains u is no greater from the respective distances of s from t1 and t2 (m is the number of edges; also let n be the number of nodes). Problem 1 Hint: Run three BFS searches.
Write a function in a directed graph represented by adjacency lists that returns true (1) if an edge exists between two provided vertices u and v and false (0) otherwise.
1. Run DFS-with-timing on this graph G: give the pre and post number of each vertex. Whenever there is a choice of vertices to explore, always pick the one that is alphabetically first. 2. Draw the meta-graph of G. 3. What is the minimum number of edges you must add to G to make it strongly connected (i.e., it consists of a single connected component after adding these edges)? Give such a set of edges. b.
Given a graph that is a tree (connected and acyclic). (1) Pick any vertex v. (II) Compute the shortest path from v to every other vertex. Let w be the vertex with the largest shortest path distance. (III) Compute the shortest path from w to every other vertex. Let x be the vertex with the largest shortest path distance. Consider the path p from w to x. Which of the following are true a. p is the longest path in the graph b. p is the shortest path in the graph c. p can be calculated in time linear in the number of edges/vertices a,c a,b a,b,c b.c
Give a linear time algorithm via pseudo code that takes as input a directed acyclic graph G (V, E) and two vertices u and v, that returns the number of simple paths from u to v in G. Your algorithm needs only to count the simple paths, not list them. Explain why your code runs in linear time.
Can you help me solve this exercise? Please note that the greedy approach described in the advice paragraph does not work.
Given N cities represented as vertices V₁, V2, un on an undirected graph (i.e., each edge can be traversed in both directions). The graph is fully-connected where the edge eij connecting any two vertices vį and vj is the straight-line distance between these two cities. We want to search for the shortest path from v₁ (the source) to VN (the destination). ... Assume that all edges have different values, and €₁,7 has the largest value among the edges. That is, the source and destination have the largest straight-line distance. Compare the lists of explored vertices when we run the uniform-cost search and the A* search for this problem. Hint: The straight-line distance is the shortest path between any two cities. If you do not know how to start, try to run the algorithms by hand on some small cases first; but remember to make sure your graphs satisfy the conditions in the question.
Given a graph G = (V;E) an almost independent set I V is a generalization of an independent set whereeach vertex u 2 I is connected to at most one other vertex in I but no more. In other words for all u; v 2 Iif (u; v) 2 E then (u; z) =2 E for all z 2 I (equvalently (v; z) =2 E). Note that every independent set is alsoalmost independent. Prove that the problem of nding whether there exists an almost independent set ofsize k for some k, is NP-complete.