The core/periphery partition for the Kansas SAR network obtained using the simulated annealing algorithm.

<p>The naming system for the agencies is from [11, p. 54), and the rows are the ‘sending’ agencies, whereas the columns are the ‘receiving’ agencies. The two boxes contain the intra-core and intra-periphery elements.</p

The core/periphery partition for the problem solving network.

<p>The two boxes contain the intra-core and intra-periphery elements.</p

The core/periphery partition for the trust network.

<p>The two boxes contain the intra-core and intra-periphery elements.</p

Attraction rates and computation times for empirical network matrices.

<p>Attraction rates and computation times for empirical network matrices.</p

The core/periphery partition for the information sharing network.

<p>The two boxes contain the intra-core and intra-periphery elements.</p

Simulated annealing (reciprocal cooling) pseudo code.

<p>Simulated annealing (reciprocal cooling) pseudo code.</p

Summary of simulation results.

<p>Summary of simulation results.</p