%==========================================================================
% File Name     : <Parallel_ConnectedGraph.m>
% Usage         : [Solution,Time] = Parallel_ConnectedGraph(problem)
% Description   : This function implements the connected graph approach in
% a parallel way. For more information on the algorithm see the function
% 'ConnectedGraph'.
%
% Note the following:
%   1) Parallelism has inherent overheads. Thus, especially when only 2 or
%   3 workers are used in parallel, the parallel algorithm might in fact be
%   slower [significantly] than the sequential version
%   2) The parameter 'rho_limit' regulates how many problems are solved on
%   a worker in parallel until the results are combined together. Tests
%   have shown that a high value of rho_limit yields good performace for
%   the connected graph algorithm. However, if a computational study is
%   attempted, the user should check several values of rho_limit to
%   understand its impact.
%--------------------------------------------------------------------------
% Author        : Richard Oberdieck, Nikolaos A. Diangelakis
% Office        : Engineering Research Building, Texas A&M University, USA
% Mail          : paroc@tamu.edu
%--------------------------------------------------------------------------
% Last Revision | Author  | Description
%---------------+---------+------------------------------------------------
% 05-Jun-2016   | RO      | Initial version
%==========================================================================