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

3. Given the following minterm expansion: F(a, b, c, d) = Em(0, 2, 3, 4, 8, 10, 11, 15) Draw the K-Map Find out all essential prime implicants, do it systematically. Do you need additional loops to cover all the minterms. If yes, find the additional prime implicants. Get the minimum SO.
In Computer Science a Graph is represented using an adjacency matrix. Ismatrix is a square matrix whose dimension is the total number of vertices.The following example shows the graphical representation of a graph with 5 vertices, its matrixof adjacency, degree of entry and exit of each vertex, that is, the total number ofarrows that enter or leave each vertex (verify in the image) and the loops of the graph, that issay the vertices that connect with themselvesTo program it, use Object Oriented Programming concepts (Classes, objects, attributes, methods), it can be in Java or in Python.-Declare a constant V with value 5-Declare a variable called Graph that is a VxV matrix of integers-Define a MENU procedure with the following textGRAPHS1. Create Graph2.Show Graph3. Adjacency between pairs4.Input degree5.Output degree6.Loops0.exit-Validate MENU so that it receives only valid options (from 0 to 6), otherwise send an error message and repeat the reading-Make the MENU call in the main…
adgis s o (6): = min { d(v) Ive V3 is the minimum degree of G. 0612 Z9Nto JJ V PO Go is called K-connected if IGI>K and GIX is connected for every set x CV with 1X1
3. Given the following minterm expansion: F(a, b, c, d) = Em(0, 2, 3, 4, 8, 10, 11, 15) Draw the K-Map Find out all essential prime implicants, do it systematically. Do you need additional loops to cover all the minterms. If yes, find the additional prime implicants. Get the minimum SOP.
2. [20 points][MID] The graph k-coloring problem is stated as follows: Given an undirected graph G = (V, E) with N vertices and M edges and an integer k. Assign to each vertex v in V a color e(r) such that 1 < e{u) < k and c(u) # c(v) for every edge (u, v) in E. In other words you want to color each vertex with one of the k colors you have and no two adjacent vertices can have the same color. For example, the following graph can be 3-colored using the following color assignments: a=1,b=2,c=1,d%32,e=3,f=2.g33 a---b---c---g d Formulate the graph k-coloring problem as an evolutionary optimization. You may use a vector of integer representation, OR any representation that you think is more appropriate. you should specify: • A representation. • itness function. Give 3 examples of individuals and their fitness values if you are solving the above example. A set of mutation and/or crossover and/or repair operators. Intelligent operators that are suitable for this particular domain will earn…
(V, E) be a connected, undirected graph. Let A = V, B = V, and f(u) = neighbours of u. Select all that are true. Let G = a) f: AB is not a function Ob) f: A B is a function but we cannot always apply the Pigeonhole Principle with this A, B Odf: A B is a function but we cannot always apply the extended Pigeonhole Principle with this A, B d) none of the above
Ques.4 If we are given n points P = {P1, P2,.... Pn} in general position where each point p(i), is labelled with a positive integer d(i), and ∑ d(i) = 2n-2 then there is an algorithm that takes O(nlogn) time to find a dc-embedding on p
Is the following statement true or false? a. Performing one rotation always preserves the AVL property. b. For any two functions f and g, we always have either f = O(g) or g = O(f). c. We run the breadth-first search algorithm (BFS) on a undirected graph G such that all edges have the same weight. BFS returns the shortest path from a source vertex s to any other vertex.
[5 minutes] Complete the K-map for the following reduced Boolean equation of F(abcd) = c + a'bd. The K-map's sixteen cells are labeled and ordered 1 through 16. ab cd 00 00 1 1: A 01 5 11 9 10 11 10 13 14 5: N 01 A A/ 16: 23 4 7 8 2: 22 A 6: 13: 12 15 16 A 10 A A 10: 3 A/ 7: 14: A/ 4: A 11: A 8: A 15:
3. 4. Given a directed acyclic graph G = (V, E) and two vertices s, te V, design an efficient algorithm that computes the number of different directed paths from s to t. Define the incidence matrix B of a directed graph with no self-loop to be an nxm matrix with rows indexed by vertices, column indexed by edges such that Bij = -1 1 0 if edge j leaves vertex i, if edge jenters vertex i, otherwise. Let BT be the transpose of matrix B. Find out what the entries of the n x n matrix BBT stand for.
3) The graph k-coloring problem is stated as follows: Given an undirected graph G = (V,E) with N vertices and M edges and an integer k. Assign to each vertex v in Va color c(v) such that 1< c(v)
3. We are given a weighted undirected graph G containing exactly 10 cycles. Write an algorithm to compute the MST of G. Your algorithm should have a runtime of O(V + E).