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 “"planar separators"”.

  1. Separators in High-Genus Near-Planar Graphs

    Graph separators are a powerful tool that are motivated by divide and conquer algorithms on graphs. Results have shown the existence of separators in arbitrary planar graphs and other graphs with less restricted structure. This work explores planar separators and the planar separator theorem, as …

    rit Repository record for Separators in High-Genus Near-Planar Graphs (opens in a new tab)

  2. A Sparsification Based Algorithm for Maximum-Cardinality Bipartite Matching in Planar Graphs

    … the Maximum Cardinality Bipartite Matching in Planar Graphs. In this work, we present a novel sparsification based approach for computing maximum/perfect bipartite matching in planar graphs. The overall complexity of our algorithm is O(n<sup>6/5</sup> log² n) where n is the number of vertices …

    vt Repository record for A Sparsification Based Algorithm for Maximum-Cardinality Bipartite Matching in Planar Graphs (opens in a new tab)