An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
From MaRDI portal
Publication:4763752
Recommendations
- An improved spectral bisection algorithm and its application to dynamic load balancing
- scientific article; zbMATH DE number 991436
- Min-max-boundary domain decomposition
- Partitioning graphs on message-passing machines by pairwise mincut
- A parallel graph partitioning algorithm for a message-passing multiprocessor
Cited in
(only showing first 100 items - show all)- A direct approach to conformational dynamics based on hybrid Monte Carlo
- Min-max-boundary domain decomposition
- Load balancing for the parallel adaptive solution of partial differential equations
- An efficient approach for large scale graph partitioning
- The <scp>K‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp>
- Iterative denoising
- Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
- Consistency of spectral clustering
- Parallel DNS algorithm on unstructured grids
- Spectral clustering and the high-dimensional stochastic blockmodel
- An experimental evaluation of local search heuristics for graph partitioning
- Parallel multilevel algorithms for hypergraph partitioning
- Continuous quadratic programming formulations of optimization problems on graphs
- Isoperimetric Partitioning: A New Algorithm for Graph Partitioning
- Web document clustering using hyperlink structures
- A deterministic annealing algorithm for approximating a solution of the min-bisection problem
- An efficient memetic algorithm for the graph partitioning problem
- The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks
- Quality meshing based on STL triangulations for biomedical simulations
- Path optimization for graph partitioning problems
- Spectral partitioning with multiple eigenvectors
- Lanczos-type variants of the COCR method for complex nonsymmetric linear systems
- BIFURCATION TRACKING ALGORITHMS AND SOFTWARE FOR LARGE SCALE APPLICATIONS
- Higher-order moving mesh methods for PDE-constrained shape optimization
- A hybrid meta-heuristic for multi-objective optimization: MOSATS
- Geometric Separators for Finite-Element Meshes
- Airspace sectorization with constraints
- A multilevel bilinear programming algorithm for the vertex separator problem
- Spectral bisection with two eigenvectors
- Two improved algorithms for envelope and wavefront reduction
- On spectral bounds for the \(k\)-partitioning of graphs
- Partitioning mathematical programs for parallel solution
- An exact combinatorial algorithm for minimum graph bisection
- Parallel adaptive subspace correction schemes with applications to elasticity
- A bounded-error quantum polynomial-time algorithm for two graph bisection problems
- An exact algorithm for graph partitioning
- Bisection for parallel computing using Ritz and Fiedler vectors
- Latent semantic analysis and Fiedler retrieval
- Beyond good partition shapes: an analysis of diffusive graph partitioning
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
- An exact approach for the multi-constraint graph partitioning problem
- High-quality surface remeshing using harmonic maps. II: Surfaces with high genus and of large aspect ratio
- A first multilevel cooperative algorithm for capacitated multicommodity network design
- Direct graph \(k\)-partitioning with a Kernighan-Lin like heuristic
- Spectral clustering and its use in bioinformatics
- scientific article; zbMATH DE number 1526386 (Why is no real title available?)
- State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control
- A new method, the fusion fission, for the relaxed \(k\)-way graph partitioning problem, and comparisons with some multilevel algorithms
- Speeding up a memetic algorithm for the max-bisection problem
- Unstructured grid adaptation for multiscale finite volume method
- Local expansion concepts for detecting transport barriers in dynamical systems
- Inexact overlapped block Broyden methods for solving nonlinear equations
- Parallel load balancing for dynamic execution environments
- Spectral partitioning works: planar graphs and finite element meshes
- Large-scale stabilized FE computational analysis of nonlinear steady-state transport/reaction systems
- Multiphase mesh partitioning
- Parallel dynamic load balancing strategies for adaptive irregular applications
- On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint
- Sparse direct factorizations through unassembled hyper-matrices
- An efficient communications strategy for finite element methods on the Connection Machine CM-5 system
- Scalability of finite element applications on distributed-memory parallel computers
- Global optimization of nonconvex problems with multilinear intermediates
- QMC Sampling from Empirical Datasets
- Dual multilevel optimization
- Role of normalization in spectral clustering for stochastic blockmodels
- Co-clustering documents and words by minimizing the normalized cut objective function
- Parallel adaptation of general three-dimensional hybrid meshes
- Dynamic load balancing in computational mechanics
- Using domain decomposition to find graph bisectors
- An evaluation study of clustering algorithms in the scope of user communities assessment
- A unified framework of multi-objective cost functions for partitioning unstructured finite element meshes
- scientific article; zbMATH DE number 1174760 (Why is no real title available?)
- Cavity flow characteristics and applications to kidney stone removal
- Graph reduction with spectral and cut guarantees
- scientific article; zbMATH DE number 2098239 (Why is no real title available?)
- Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication
- Homogeneous grouping of non-prime steel products for online auctions: a case study
- Sequential composition of linear systems' clans
- Higher-order compatible finite element schemes for the nonlinear rotating shallow water equations on the sphere
- scientific article; zbMATH DE number 2086813 (Why is no real title available?)
- Improvements on spectral bisection
- Effect of the storage format of sparse linear systems on parallel CFD computations
- Optimality of spectral clustering in the Gaussian mixture model
- Network bipartitioning in the anti-communicability Euclidean space
- COMBINING HELPFUL SETS AND PARALLEL SIMULATED ANNEALING FOR THE GRAPH-PARTITIONING PROBLEM∗
- Relaxation-based coarsening for multilevel hypergraph partitioning
- Analysis of a Helmholtz preconditioning problem motivated by uncertainty quantification
- Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
- scientific article; zbMATH DE number 1894383 (Why is no real title available?)
- Optimized quantum circuit partitioning
- How to divide a catchment to conquer its parallel processing. An efficient algorithm for the partitioning of water catchments
- Disentangling group and link persistence in dynamic stochastic block models
- Efficient algorithm for optimizing spectral partitions
- The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
- Recursive spectral algorithms for automatic domain partitioning in parallel finite element analysis
- The effect of graph partitioning techniques on parallel block FSAI preconditioning: a computational study
- Approximating spectral clustering via sampling: a review
- Eigenanalysis-based task mapping on parallel computers with cellular networks
- Robust Multigrid Techniques for Augmented Lagrangian Preconditioning of Incompressible Stokes Equations with Extreme Viscosity Variations
- Multiway \(p\)-spectral graph cuts on Grassmann manifolds
This page was built for publication: An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4763752)
