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 “"Separating cycle"”.

  1. Testing vertex connectivity of bowtie 1-plane graphs

    A separating set of a connected graph $G$ is a set of vertices $S$ such that $G-S$ is disconnected. $S$ is a minimum separating set of $G$ if there is no separating set of $G$ with fewer vertices than $S$. The size of a minimum separating set of $G$ is called the vertex connectivity of $G$. A …

    waterloo Repository record for Testing vertex connectivity of bowtie 1-plane graphs (opens in a new tab)

  2. Combinatorial optimization on embedded curves

    … embedded on a surface of genus g with b boundary cycles, we can compute the shortest single cycle Z2-homologous to a given even subgraph in 2^{O(g+b)}nlog n time. As a consequence we obtain an algorithm to compute the shortest directed non-separating cycle in 2^{O(g)}n log n time, which improves …

    uiuc Repository record for Combinatorial optimization on embedded curves (opens in a new tab)