(15 pts.) We are given a graph G = /,E); G could be a directed graph or undirected graph. Let M be the adjacency matrix of G. Let n be the number of vertices so that the matrix M is n x n matrix. For any matrix A, let us denote the element of i-th row and j-th column of the matrix A by A[i, j]. 1. Consider the square of the adjacency matrix M. For all i and j, show that M²[i, j] is the number of different paths of length 2 from the i-th vertex to the j-th vertex. It should be explained or proved as clearly as possible. 2. For any positive integer k, show that Mk[i, j] is the number of different paths of length k from the i-th vertex to the j-th vertex. You may use induction on k to prove it. 3. Assume that we are given a positive integer k. Design an algorithm to find the number of different paths of length k from the i-th vertex to j-th vertex for all pairs of (i, j). The time complexity of your algorithm should be O(n³ log k). You can get partial credits if you design an algorithm of O(n³k).

(15 pts.) We are given a graph G = /,E); G could be a directed graph or undirected graph. Let M be the adjacency matrix of G. Let n be the number of vertices so that the matrix M is n x n matrix. For any matrix A, let us denote the element of i-th row and j-th column of the matrix A by A[i, j]. 1. Consider the square of the adjacency matrix M. For all i and j, show that M²[i, j] is the number of different paths of length 2 from the i-th vertex to the j-th vertex. It should be explained or proved as clearly as possible. 2. For any positive integer k, show that Mk[i, j] is the number of different paths of length k from the i-th vertex to the j-th vertex. You may use induction on k to prove it. 3. Assume that we are given a positive integer k. Design an algorithm to find the number of different paths of length k from the i-th vertex to j-th vertex for all pairs of (i, j). The time complexity of your algorithm should be O(n³ log k). You can get partial credits if you design an algorithm of O(n³k).

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

Computer Science --- Graph Algorithms
plz with python
*Data Structures and Algorithm(C Programming) Question: Answer the following questions about graphs. (a) What is the maximum number of edges that can exist in an undirected graph? Why? Explain. (b) What is a cycle in a directed graph? (c) Given a graph G(V, E), its inverse consists of a graph G′ where the edges of the original graph is inverted. That is, for all (u, v) ∈ G.E, ∃(v, u) ∈ G′ .E. Describe a nonempty directed graph G such that G = G′ . (d) Topological sorting in a directed graph is a linear ordering of its vertices. Does existence of a cycle in a graph violate a topological sorting? Why/why not? (e) Depth First Search can be used as a subroutine to solve other problems, topological sorting being an example of this. Explain the intuition behind using DSF in the calculation of topological sort. (Note: I'm not asking you about how DFS is used in topological sorting. Rather, I'm asking what is needed to topologically sort graphs and how DFS becomes useful to achieve…
4) Find a polygon with 9 vertices for which exactly m cameras are necessary, where (I) m = 1 and (II) m = 2.
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.
How many entries would the adjacency matrix representation for the following graph contain? D B E A F C G
B A E D Write the Adjacency Matrix of the given graph. F G H
. For each of the following, draw an Eulerian graph that satisfies the conditions, orprove that no such graph exists.a) An even number of vertices, an even number of edges.b) An even number of vertices, an odd number of edges.c) An odd number of vertices, an even number of edges.d) An odd number of vertices, an odd number of edges.
(a) Show that a graph G with at least three vertices is 2-connected if and only if any vertex and any edge of G lie on a common cycle of G: (b) Show that a graph G with at least three vertices is 2-connected if and only if any two edges of G lie on a common cycle
(c) Assume you are having a graph in which there are two shortest paths from the source node u to a node v with different number of intermediate vertices. Modify Dijkstra's algorithm in such a way that it always prefers the path with fewest intermediate edges/vertices. What is the complexity of this modified algorithm?
a) Illustrate the sequence of vertices of this graph visited using depth-first search traversal starting at vertex g. b) Illustrate adjacency list representation and adjacency matrix representation, respectively, for this graph. What are the advantages and disadvantages of those two representations? c) Describe an algorithm to find in the graph a path illustrated below that goes through every edge exactly once in each direction.
Given a graph G, please do the following: a) Show the adjacency matrix for graph G. b) Show the adjacency list for graph G. I 1 6 2 4 7 3 5 Graph G