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 “"k-connectedness"”.

  1. k-Connectedness and k-Factors in the Semi-Random Graph Process

    … a k-factor. We settle the open case for 2-connectedness by showing that the player has a strategy to construct a 2-connected graph asymptotically almost surely in (ln 2+ln(ln 2+1)+o(1))n rounds, which matches a known lower bound asymptotically. We also provide a strategy for building a …

    waterloo Repository record for k-Connectedness and k-Factors in the Semi-Random Graph Process (opens in a new tab)

  2. On Parallelization of Graph Algorithms, Performance Modelling and Autonomous 3D Printable Object Synthesis

    … can also be applied to find the value of k (connectedness) for a given graph. It is validated using number of different types of graphs such as complete graphs, complete bipartite graphs, and chorded cycle graphs of sizes ranging from ����,�� , 20 ≤ �� ≤ 300. For GPU architecture we proposed …

    south-carolina Repository record for On Parallelization of Graph Algorithms, Performance Modelling and Autonomous 3D Printable Object Synthesis (opens in a new tab)