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 5 of 5 for “"graph 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. Exponential time algorithms via separators and random subsets

    … extending on and using known techniques such as graph separators, and random subset selection. We first present a polynomial-space algorithm that computes the number of independent sets of any input graph in time O(1.1389^n) for graphs with maximum degree 3 and in time O(1.2356^n) for general …

    unsw Repository record for Exponential time algorithms via separators and random subsets (opens in a new tab)

  3. The size and depth of Boolean circuits

    … and Sarma. Since the existence of small balanced separators in a directed acyclic graph implies that the graph also has small segregators, our results also apply to circuits with small separators. Our results imply that the class of languages computed by non-uniform families of polynomial size …

    texas Repository record for The size and depth of Boolean circuits (opens in a new tab)

  4. 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)

  5. New Algorithms for Mining Network Datasets: Applications to Phenotype and Pathway Modeling

    … screens by viewing the perturbed genes as a graph separator. Both of these data mining applications are evaluated on network datasets from S. cerevisiae and C. elegans. Finally, we present an approach to model the relationship between metabolic pathways and operon structure in prokaryotic …

    vt Repository record for New Algorithms for Mining Network Datasets: Applications to Phenotype and Pathway Modeling (opens in a new tab)