Network Science: Strongly Connected Components

Which of the following statements is true about the Kosaraju-Sharir's algorithm? 

A) It is used to find the shortest path between two nodes in a graph.

B) It is a greedy algorithm that always finds the optimal solution.

C) It is used to determining the strongly connected components in a directed graph.

D) It is used to computing the minimum spanning tree of a graph

E) None of the above.


Original idea by: Arthur Hendricks.

Comments

Post a Comment

Popular posts from this blog

Networks and Graphs - Random Graphs

Random graphs are a type of mathematical object used to model complex systems, such as social networks on the internet. In a random graph with n vertices and edge probability p, the typical distance between two  vertices  follows a known property called small world phenomena which implies that: A) The distances between all pairs of vertices will be the same. B) The distances between vertices will follow a normal distribution. C) The distances between vertices will be roughly proportional to log(n). D) The distances between vertices will be randomly distributed. E) None of the above. Original idea by: Arthur Hendricks.
Read more

Network Flow

Which of the following statements is true when comparing the Ford-Fulkerson algorithm and the Push-Relabel algorithm for solving maximum flow problems in networks? A) The Ford-Fulkerson algorithm is a specific implementation of the  Push-Relabel algorithm . B)  The Ford-Fulkerson algorithm always terminates in polynomial time for any network . C)  The Push-Relabel algorithm  is a more efficient and faster alternative to the Ford-Fulkerson algorithm.  D) Both t he Ford-Fulkerson and Push-Relabel algorithms can find the maximum flow in a network, but the Push-Relabel algorithm garantees a shorter runtime. E) None of the above. Original idea by: Arthur Hendricks.
Read more