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 “"Graph matchings"”.

  1. Duality theory for optimal mechanism design

    … its connection with the theory of bipartite graph matchings.</p> <p>We demonstrate the power of the framework by applying it to various special monopoly settings where a seller of multiple heterogeneous goods faces a buyer with independent item values drawn from various distributions of …

    oxford Repository record for Duality theory for optimal mechanism design (opens in a new tab)

  2. A Separator-Based Framework for Graph Matching Problems

    Given a graph, a matching is a set of vertex-disjoint edges. Graph matchings have been well studied, since they play a fundamental role in algorithmic theory as well as motivate many practical applications. Of particular interest is the problem of finding a maximum cardinality matching of a graph. …

    vt Repository record for A Separator-Based Framework for Graph Matching Problems (opens in a new tab)

  3. Bounds on Maximum Matchings in 1-Planar Graphs

    In this thesis, we study lower bounds on maximum matchings in 1-planar graphs. We expand upon the tools used for proofs of matching bounds in other classes of graphs as well as some original ideas in order to find these bounds. The first novel results we provide are lower bounds on maximum …

    waterloo Repository record for Bounds on Maximum Matchings in 1-Planar Graphs (opens in a new tab)