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 1 of 1 for “"minimum spanning forests"”.

  1. Private Two-Party Random Minimum Spanning Forest Computation

    Finding the Minimum Spanning Tree, or more generally the Minimum Spanning Forest (MSF), of a weighted graph is a well-known algorithmic problem. While this problem itself can be directly applied to any kind of networks, it also has less obvious applications like the approximation of the Traveling …

    waterloo Repository record for Private Two-Party Random Minimum Spanning Forest Computation (opens in a new tab)