2022-013
Rubens de Castro Pereira MO412 - Graph Algorithms
This blog aims to publish the quiz questions of the discipline MO412 (Graph Algorithms) presented by Prof Meidanis in the Graduate Program in Computer Science of the Institute of Computing of the University of Campinas (Unicamp).
MathJax
Thursday, November 24, 2022
Thursday, November 17, 2022
Thursday, November 10, 2022
Quiz Question – Network Robustness
2022-011
Related to the Percolation Theory and Cascading Failures, analyze the statements below:
1. Percolation theory shows that the percolating
cluster occurs when it is possible to observe a phase transition from
many small clusters to a percolating cluster that percolates the whole lattice.
2. The branching model is one of the cascading
failures where the node whose initial failure triggers the avalanche of the
tree's root and its branches are the nodes whose failure was triggered by this
initial failure.
3. The failure propagation model is frequently used
to describe cascading failures in networks where a healthy node i changes its
state if a φ fraction of its neighbors have failed.
4. The failure propagation models predict the existence of a critical state in which the avalanche sizes follow a power law, and the avalanche exponent α is uniquely determined by the degree exponent of the network on which the avalanche propagates.
Select the correct alternative:
Monday, October 24, 2022
Quiz Question – Strongly Connected Components (SCC) – Kosaraju-Sharir’s algorithm
2022-010
Using the Kosaraju-Sharir’s algorithm, analyze the statements about the Strongly Connected Components (SCC) extracted from the graph:
Thursday, October 20, 2022
Thursday, October 6, 2022
Quiz Question - The Barabási-Albert Model
Analyze the following statements about the network:
1. Choosing which node will be connected uses the preferential attachment criteria.
2. After \(t\) timesteps, this model generates a network with \(N = t +
m_0\) nodes.
3. The degree distribution of this network follows the Poisson
distribution.
4. This network has scale-free property.
5. The diameter of this network with N nodes can be estimated by the equation \(D \sim \frac {(log N)}{ (log log N)} \).
Select the correct alternative:
Thursday, September 29, 2022
Quiz Question – Network Flow
2022-013 Consider the graph below and the flow from 1 to 10, where the capacity value is defined in each link. Select the correct alternativ...

