MathJax


Tuesday, June 8, 2021

2021-036

Consider a Random Network such that \( N = 1000 \) and \( p = 0.004 \). We need to break apart its giant component, and the only way to do that is by randomly removing nodes. Under these conditions, how many nodes should we remove at minimum to have a good chance of achieving our goal?

  1. 750
  2. 720
  3. 840
  4. 810
  5. None of the above.

Original idea by: José Nascimento

No comments:

Post a Comment

2025-261

Consider a directed graph \(G\)   and the Kosaraju-Sharir's algorithm for finding strongly connected components (SCCs). Analyze the foll...