Posts

Showing posts from May, 2023

Network Science: Network Robustness

  Which of the following statements correctly describes the robustness of scale-free networks? A) Scalle-free networks are highly robust against targeted attacks but vulnerable to random node removal. B) Scalle-free networks are equally robust against random node removal and targeted attacks. C) Scalle-free networks are highly robust against random node removal but vulnerable to targeted attacks. D) Scalle-free networks are vulnerable to both random node removal and targeted attacks. E) None of the above. Original idea by: Arthur Hendricks.

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.