MathJax


Tuesday, November 15, 2022

2022-181

The Kosaraju-Sharir algorithm is an algorithm used to find strongly connected components in a graph.

Applying the algorithm on the graph given above, how many strongly connected components do we find, and what is the size of the biggest component, and the size of the smallest? (respectively)

  1. 4, 7, 2
  2. 4, 8, 1
  3. 5, 6, 2
  4. 6, 5, 1
  5. None of the above.

  Original idea by: Pedro Henrique Di Francia Rosso

at
Labels:

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

2023-228

A company launched a new gadget C to be produced globally for North American and South American markets. The company uses just-in-time as ...

  • 2022-174
    In the Non-linear preferential attachment, the preferential attachment probability becomes \( \Pi(k) \sim k^{\alpha} \). For a starting netw...
  • 2021-041
    Considering the following network and its partition in green and pink nodes: The modularity \( M \) of a partition can be computed using...
  • 2022-102
    Select the correct alternative based on the following statements: A very large network in the scale-free regime should have \( \langle k...