Graph partitioning models for parallel computing
From MaRDI portal
Publication:1583333
DOI10.1016/S0167-8191(00)00048-XzbMATH Open0948.68130OpenAlexW2065309575WikidataQ56171385 ScholiaQ56171385MaRDI QIDQ1583333FDOQ1583333
Authors: Bruce A. Hendrickson, Tamara G. Kolda 
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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cited In (42)
- Динамическая балансировка с помощью пакета параллельной декомпозиции GridSpiderPar
- Graph Labelings Derived from Models in Distributed Computing
- A social network based patching scheme for worm containment in cellular networks
- Scalable parallel implementation of CISAMR: a non-iterative mesh generation algorithm
- Graph models and their efficient implementation for sparse Jacobian matrix determination
- Large-scale stabilized FE computational analysis of nonlinear steady-state transport/reaction systems
- Particle-Continuum Multiscale Modeling of Sea Ice Floes
- Current challenges in parallel graph partitioning
- The partitioning of QSDF computation graphs
- SDP-based bounds for graph partition via extended ADMM
- Partitions of networks that are robust to vertex permutation dynamics
- Title not available (Why is that?)
- Parallel Performance Model for Vertex Repositioning Algorithms and Application to Mesh Partitioning
- An exact approach for the balanced \(k\)-way partitioning problem with weight constraints and its application to sports team realignment
- A Matrix Partitioning Interface to PaToH in MATLAB
- Parallel multilevel algorithms for hypergraph partitioning
- A new method for quantifying network cyclic structure to improve community detection
- Some graph partitioning problems
- Optimal hierarchical clustering on a graph
- Load-balancing spatially located computations using rectangular partitions
- Computing hypergraph homology
- Parameterized Minimum Cost Partition of a Tree with Supply and Demand
- New challenges in dynamic load balancing
- A graph partitioning scheme and applications to fault tolerant computing
- Neighborhood decomposition-driven variable neighborhood search for capacitated clustering
- An iterative parallel workload balancing framework for direct condensation of substructures
- Metropolized Forest Recombination for Monte Carlo Sampling of Graph Partitions
- Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
- An exact approach for the multi-constraint graph partitioning problem
- A physics-motivated centroidal Voronoi particle domain decomposition method
- Title not available (Why is that?)
- How to divide a catchment to conquer its parallel processing. An efficient algorithm for the partitioning of water catchments
- Load balancing fictions, falsehoods and fallacies
- Title not available (Why is that?)
- Detecting Overlapping Communities in Networks Using Spectral Methods
- Hierarchical \(\mathsf{k}_{\mathsf{t}}\) jet clustering for parallel architectures
- Parallel mesh-partitioning algorithms for generating shape optimised partitions using evolutionary computing
- Social network community detection using agglomerative spectral clustering
- Tree-Based Coarsening and Partitioning of Complex Networks
- Performance of fully coupled domain decomposition preconditioners for finite element transport/reaction simulations
- A novel partitioning method for block-structured adaptive meshes
- Parallelization domain oriented multilevel graph partitioner
This page was built for publication: Graph partitioning models for parallel computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583333)
