The transpose of a directed graph G = (V, E) is the graph G' = (V, E'), where ET = {(v, u) e V x V : (u, v) e E}. Thus, GT is G with all its edges reversed Describe efficient algorithms for computing GT from G, for both the adjacency- list and adjacency-matrix representations of G. Analyze the running times of your algorithms. %3D

The transpose of a directed graph G = (V, E) is the graph G' = (V, E'), where ET = {(v, u) e V x V : (u, v) e E}. Thus, GT is G with all its edges reversed Describe efficient algorithms for computing GT from G, for both the adjacency- list and adjacency-matrix representations of G. Analyze the running times of your algorithms. %3D

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

An undirected graph G = (V, E) is called “k-colorable” if there exists a way to color the nodes withk colors such that no pair of adjacent nodes are assigned the same color. I.e. G is k-colorable iff there existsa k-coloring χ : V → {1, . . . , k}, such that for all (u, v) ∈ E, χ(u) ̸= χ(v) (the function χ is called a properk-coloring). The “k-colorable problem” is the problem of determining whether an input graph G = (V, E) isk-colorable. Prove that the 3-colorable problem ≤P the 4-colorable problem.
The reverse of a directed graph G = (V,E) is another directed graph G^R = (V,E^R) on the same vertex set, but with all edges reversed; that is, E^R = {(v, u) : (u, v) ∈ E}.Give a linear-time algorithm for computing the reverse of a graph in adjacency list format.
Most graph algorithms that take an n×n adjacency-matrix representation as input require at least time O(n^2), but there are some exceptions. Show how to determine whether a simple directed graph G contains a universal sink, that is, a vertex with in degree n − 1 and out-degree 0, in time O(n) given an n × n adjacency matrix for G. (A vertex v has indegree k if there are precisely k edges of the form (u, v), and has outdegree k if there are precisely k edges of the form (v, u).)
Throughout, a graph is given as input as an adjacency list. That is, G is a dictionary where the keysare vertices, and for a vertex v,G[v] = [u such that there is an edge going from v to u].In the case that G is undirected, for every edge u − v, v is in G[u] and u is in G[v]. 3. Write the full pseudocode for the following problem.Input: A directed graph G, and an ordering on the vertices given in a list A.Output: Is A a topological order? In other words, is there an i, j such that i < j and there is an edge fromA[j] to A[i]?
Let G = (V, E) be a directed graph, and let wv be the weight of vertex v for every v ∈ V . We say that a directed edgee = (u, v) is d-covered by a multi-set (a set that can contain elements more than one time) of vertices S if either u isin S at least once, or v is in S at least twice. The weight of a multi-set of vertices S is the sum of the weights of thevertices (where vertices that appear more than once, appear in the sum more than once).1. Write an IP that finds the multi-set S that d-cover all edges, and minimizes the weight.2. Write an LP that relaxes the IP.3. Describe a rounding scheme that guarantees a 2-approximation to the best multi-set
Provide an eficient algorithm that given a directed graph G with n vertices and m edges as input, finds the outdegree of each vertex in G. Note that outdegree of a vertex u is the number of edges directed from u to some other vertex v. Discuss the running-time of your algorithm and Provide an algorithm that given a directed graph G with n vertices and m edges as input, nds the indegree of each vertex in G. Note that indegree of a vertex u is the number of edges directed into u from some other vertex v. Discuss the running-time of your algorithm.
Create an algorithm for the monotonic evaluation function, algorithm A*.Graph G = (V, E); start vertex s; target vertex r; A-Star(G, s, r) in; out: maps as: V VLocal: Heuristic lower bound estimate h(u v), open list S, cost function g(u v),
A directed graph G= (V,E) consists of a set of vertices V, and a set of edges E such that each element e in E is an ordered pair (u,v), denoting an edge directed from u to v. In a directed graph, a directed cycle of length three is a triple of vertices (x,y,z) such that each of (x,y) (y,z) and (z,x) is an edge in E. Write a Mapreduce algorithm whose input is a directed graph presented as a list of edges (on a file in HDFS), and whose output is the list of all directed cycles of length three in G. Write the pseudocode for the mappers/reducers methods. Also, assuming that there are M mappers, R reducers, m edges and n vertices -- analyze the (upper-bound of the) communication cost(s).
Suppose are you given an undirected graph G = (V, E) along with three distinct designated vertices u, v, and w. Describe and analyze a polynomial time algorithm that determines whether or not there is a simple path from u to w that passes through v. [Hint: By definition, each vertex of G must appear in the path at most once.]
Given the adjacency matrix of an undirected simple graph G = (V, E) mapped in a naturalfashion onto a mesh of size n2, in Θ(n) time a directed breadth-first spanning forest T = (V, A) can becreated. As a byproduct, the undirected breadth-first spanning forest edge set EA can also be created,where EA consists of the edges of A and the edges of A directed in the opposite direction.
Suppose you are given a connected weighted undirected graph, G, with n vertices and m edges, such that the weight of each edge in G is an integer in the interval [1, c], for a fixed constant c > 0. Show how to solve the single-source shortest-paths problem, for any given vertex v, in G, in time O(n + m). Please don't copy and paste the other answers to this question. I'm posting it because the other answers either don't answer the question or have a complicated way of solving the problem.
Given an undirected graph we would like to test its connectivity, and if graphis disconnected we would like to add a minimal number of edges to it, so the resultinggraph is connected. Design an efficient algorithm for this problem. Your algorithm takesa graph G = (V, E) with vertices V = {1, 2, . . . , n}, returns CONNECTED (if the inputgraph is connected), or the list of edges to be added to this graph to make it connected.Provide clear pseudocode solution, justification of the correctness and analyze runningtime complexity of your algorithm.