Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"forest partition"”.

  1. Irreversible k-threshold conversion processes on graphs

    … of several known results on colourings and forest partitions of (k+1)-regular graphs and graphs of maximum degree k+1.

    uvic Repository record for Irreversible k-threshold conversion processes on graphs (opens in a new tab)

  2. On the Role of Partition Inequalities in Classical Algorithms for Steiner Problems in Graphs

    … a 2-approximation (for the more general Steiner forest problem) due to Agrawal, Klein and Ravi. Their analysis is tight as the LP-relaxation used in their work is known to be weak: it has an IP/LP gap of approximately 2. <br /><br /> Most recent efforts to obtain algorithms for the Steiner tree …

    waterloo Repository record for On the Role of Partition Inequalities in Classical Algorithms for Steiner Problems in Graphs (opens in a new tab)