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 3 of 3 for “"bottleneck matching"”.

  1. Computing Exact Bottleneck Distance on Random Point Sets

    … sets of points containing n points each, in a bottleneck matching problem, we want to find an one-to-one correspondence, also called a matching, that minimizes the length of its largest edge; the length of an edge is simply the Euclidean distance between its end-points. As an application, …

    vt Repository record for Computing Exact Bottleneck Distance on Random Point Sets (opens in a new tab)

  2. Matchings in Geometric Graphs

    … edge set contains straight-line segments. A matching in a graph is a subset of edges of the graph with no shared vertices. A matching is called perfect if it matches all the vertices of the underling graph. A geometric matching is a matching in a geometric graph. In this thesis, we study …

    carleton Repository record for Matchings in Geometric Graphs (opens in a new tab)