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 6 of 6 for “"edge cut"”.

  1. Odd multiway cut in directed acyclic graphs

    We investigate the odd multiway node (edge) cut problem where the input is a graph with a specified collection of terminal nodes and the goal is to find a smallest subset of non-terminal nodes (edges) to delete so that the terminal nodes do not have an odd length path between them. In an earlier …

    uiuc Repository record for Odd multiway cut in directed acyclic graphs (opens in a new tab)

  2. Thanos: High-performance CPU-GPU based balanced graph partitioning using cross-decomposition

    … we have achieved a 30x speedup and 35% better edge cut reduction compared to the CPU version of METIS on average.

    uiuc Repository record for Thanos: High-performance CPU-GPU based balanced graph partitioning using cross-decomposition (opens in a new tab)

  3. Improved distributed algorithms for fundamental graph problems

    … independent set, minimum spanning tree, minimum edge cut and minimum vertex cut, graph connectivity decompositions, network information dissemination, minimum-weight connected dominating set, and scheduling distributed protocols. We develop novel techniques, concepts, and tools for these …

    mit Repository record for Improved distributed algorithms for fundamental graph problems (opens in a new tab)

  4. Effect of Tensile Rate and Carbon Black on the Fracture of Natural Rubber and Styrene-Butadiene Rubber

    … stronger.Previous research has shown that edge-cut specimens of gum NR show an abrupt drop in tensile strength, when tested at 50 mm/min at a critical cut size, because of lack of time to crystallize in bulk. In this thesis, the behavior of critical cut size with respect to tensile rate is …

    ohiolink Repository record for Effect of Tensile Rate and Carbon Black on the Fracture of Natural Rubber and Styrene-Butadiene Rubber (opens in a new tab)

  5. Eulerian Properties of Design Hypergraphs and Hypergraphs with Small Edge Cuts

    … hypergraph is a closed walk that traverses every edge exactly once; if a hypergraph admits such a walk, then it is called eulerian. Although this notion is one of the progenitors of graph theory --- dating back to the eighteenth century --- treatment of this subject has only begun on hypergraphs …

    ottawa-retro Repository record for Eulerian Properties of Design Hypergraphs and Hypergraphs with Small Edge Cuts (opens in a new tab)

  6. Sustaining Glasgow's Urban Networks: the Link Communities of Complex Urban Systems

    … inequalities. Building on the myriad of knowledge from planners, geographers, sociologists and computer scientists, I developed a new element (i.e. link communities) within the theory of urban studies that defines cities as complex systems. After, I applied a method borrowed from the study of …

    westminster Repository record for Sustaining Glasgow's Urban Networks: the Link Communities of Complex Urban Systems (opens in a new tab)