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 3 of 3 for “"Graph Partitioning Algorithm"”.

  1. New Differential Zone Protection Scheme Using Graph Partitioning for an Islanded Microgrid

    … new differential zone protection scheme using a graph partitioning algorithm. A graph partitioning algorithm is used to partition the microgrid into multiple protective zones. The IEEE 13-node microgrid is used to demonstrate the proposed protection scheme. The protection scheme is validated with …

    vt Repository record for New Differential Zone Protection Scheme Using Graph Partitioning for an Islanded Microgrid (opens in a new tab)

  2. Multilevel spectral clustering : graph partitions and image segmentation

    While the spectral graph partitioning method gives high quality segmentation, segmenting large graphs by the spectral method is computationally expensive. Numerous multilevel graph partitioning algorithms are proposed to reduce the segmentation time for the spectral partition of large graphs. …

    mit Repository record for Multilevel spectral clustering : graph partitions and image segmentation (opens in a new tab)

  3. 0-1 graph partitioning and image segmentation

    Graph partitioning is the grouping of all the nodes in a graph into two or more partitions based on certain criteria. Graph cut techniques are used to partition a graph. The Minimum Cut method gives imbalanced partitions. To overcome the imbalanced partitioning, the Normalized Cut method is used. …

    mit Repository record for 0-1 graph partitioning and image segmentation (opens in a new tab)