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 20 of 147 for “"graph partitioning"”.
-
Graph partitioning under the spectral lens
… από τα πιο βασικά προβλήματα της περιοχής: το Graph Partitioning. Ξεκινάμε με τη σημασία και το ευρύ φάσμα των εφαρμογών που βρίσκει, τις υπολογιστικές δυσκολίες που εμπλέκονται στην επίλυσή του αποτελεσματικά και τα αποτέλεσμα μη προσεγγισιμότητας που συνδέονται με αυτό. Παρουσιάζουμε τις …
-
A comparative analysis of graph partitioning tools
Not available
-
FPGA-based implementation of parallel graph partitioning
Graph partitioning is a very important application that can be found in numerous areas, from finite element methods to data processing and VLSI circuit design. Many algorithms have been developed to solve this problem. Of special interest is multilevel graph partitioning that provides a very …
-
Graph Partitioning of Transportation Networks under Disruption
… approach dealing with this matter is applying graph partitioning techniques. Graph partitioning is an optimization problem with the aim of dividing a large geographical network into manageable size districts called sub-networks with less complexity in favor of balancing the workload and …
-
Algorithms for signal decoding using graph partitioning
Thesis (M.S.)--Michigan State University. Department of Electrical Engineering, 1991
-
Sequential and distributed algorithms for fast graph partitioning
In this thesis, we deal with the following k-way graph partitioning (GP) problem: given an undirected weighted graph G = (V, E), partition the nodes of G into k parts of almost equal size such that the partition-cost (sum of the weights on edges with nodes in different parts) is minimized. We …
-
Graph Partitioning, Ordering, and Clustering for Multicore Architectures
… new algorithms and methods for the problems of graph partitioning, fill reducing ordering, and graph clustering on multicore architectures. These problems are used for the discovery and introduction of structure into this data. This is important in the fields of scientific and parallel …
-
Dynamic platform-independent meta-algorithms for graph-partitioning
… solver is developed for use with network and graph algorithms of operations research. This solver allows analysts to solve a large variety of problems without writing code. Algorithms from a library can be integrated into a meta-algorithm which also provides easy monitoring of solution …
-
Some Graph Partitioning Algorithms based on belief propagation
… this thesis project we have focused on a kind of graph partitioning problem com- monly called bi-categorical clustering, however, we also show that all results are easily extended to general graph partitioning. In this problem we get a graph asked to output a partitioning and such that the …
-
Optimization approaches for political districting and graph partitioning
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-03-01 without embargo terms
-
Probabilistic Separation and Fairness in Graph Partitioning and Assignment
… resource allocation, and Separation Fairness in graph partitioning.</p><p>We first study an assignment problem between students and schools. In this setting, we enforce Group Fairness, which requires that various student demographic groups are treated equitably. We design algorithms that trade …
-
A study of the k-way graph partitioning problem
O problema de particionamento balanceado de grafos consiste em encontrar uma partição de tamanho k dos vértices de um grafo, minimizando o número de arestas que participam do corte tal que o tamanho de nenhuma parte exceda [en~k], para algum e e > [1, k). Essa dissertação estuda esse problema, …
-
Graph partitioning: redistricting games and the spherical zoning problem
Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2025-08-01
-
Algorithms for new objectives in graph partitioning and generalizations
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-09-01 without embargo terms
-
Approximation algorithms for new graph partitioning and facility location problems
… These problems fall into two general areas: graph partitioning and facility location. The first problem that we introduce is the unbalanced graph cut problem. Here the goal is to find a graph cut, minimizing the size of one of the sides, while also respecting an upper bound on the number of …
-
CUTTANA : scalable graph partitioning for faster distributed graph databases and analytics
Graph partitioning plays a pivotal role in various distributed graph processing applications, including graph analytics, graph neural network training, and distributed graph databases. A good graph partitioner reduces workload execution time, worker imbalance, and network overhead. Graphs that …
-
Segmentation and classification of polarimetric SAR data using spectral graph partitioning
… The pair-wise grouping technique of Spectral Graph Partitioning (SGP) is employed to perform the segmentation and classification tasks based on graph cuts. A new classification algorithm is developed for POLSAR data, where segmentation based on the contour and spatial proximity cues is …
-
Eigenvalue, Quadratic Programming and Semidefinite Programming Bounds for Graph Partitioning Problems
The Graph Partitioning problems are hard combinatorial optimization problems. We are interested in both lower bounds and upper bounds. We introduce several methods including basic eigenvalue and projected eigenvalue techniques, convex quadratic programming techniques, and semidefinite programming …
-
SAR Moving Target Detection with Colorized Subaperture Imagery via Graph Partitioning
… imagery with a segmentation technique based on a graph theoretic approach. The algorithm is designed to find gradients of colored pixels, as the azimuthal defocused signature of moving targets are colored to match the gradient of the chosen colormap. This moving target signature is verified by …
Page 1 of 8