Graph partitioning models for parallel computing
From MaRDI portal
Publication:1583333
DOI10.1016/S0167-8191(00)00048-XzbMath0948.68130OpenAlexW2065309575WikidataQ56171385 ScholiaQ56171385MaRDI QIDQ1583333
Tamara G. Kolda, Bruce A. Hendrickson
Publication date: 26 October 2000
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-8191(00)00048-x
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)
Related Items
SDP-based bounds for graph partition via extended ADMM, Large-scale stabilized FE computational analysis of nonlinear steady-state transport/reaction systems, An exact approach for the balanced \(k\)-way partitioning problem with weight constraints and its application to sports team realignment, Parameterized Minimum Cost Partition of a Tree with Supply and Demand, Parallel mesh-partitioning algorithms for generating shape optimised partitions using evolutionary computing, A new method for quantifying network cyclic structure to improve community detection, A Social Network Based Patching Scheme for Worm Containment in Cellular Networks, Динамическая балансировка с помощью пакета параллельной декомпозиции GridSpiderPar, Neighborhood decomposition-driven variable neighborhood search for capacitated clustering, A physics-motivated centroidal Voronoi particle domain decomposition method, A novel partitioning method for block-structured adaptive meshes, Social network community detection using agglomerative spectral clustering, Optimal hierarchical clustering on a graph, Particle-Continuum Multiscale Modeling of Sea Ice Floes, Hierarchical \(\mathsf{k}_{\mathsf{t}}\) jet clustering for parallel architectures, Parallel multilevel algorithms for hypergraph partitioning, Load-balancing spatially located computations using rectangular partitions, Graph models and their efficient implementation for sparse Jacobian matrix determination, An exact approach for the multi-constraint graph partitioning problem, Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering, Metropolized Forest Recombination for Monte Carlo Sampling of Graph Partitions, Scalable parallel implementation of CISAMR: a non-iterative mesh generation algorithm, New challenges in dynamic load balancing, Load balancing fictions, falsehoods and fallacies, Performance of fully coupled domain decomposition preconditioners for finite element transport/reaction simulations, A Matrix Partitioning Interface to PaToH in MATLAB, An iterative parallel workload balancing framework for direct condensation of substructures, Partitions of networks that are robust to vertex permutation dynamics, Tree-Based Coarsening and Partitioning of Complex Networks, Detecting Overlapping Communities in Networks Using Spectral Methods
