Pages that link to "Item:Q1111029"
From MaRDI portal
The following pages link to A parallel graph partitioning algorithm for a message-passing multiprocessor (Q1111029):
Displaying 16 items.
- A fast algorithm for sparse matrix computations related to inversion (Q401614) (← links)
- Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions (Q422929) (← links)
- A multilevel bilinear programming algorithm for the vertex separator problem (Q683341) (← links)
- Task scheduling for parallel sparse Cholesky factorization (Q915427) (← links)
- Quotient tree partitioning of undirected graphs (Q1075056) (← links)
- A parallel graph partitioning algorithm for a message-passing multiprocessor (Q1111029) (← links)
- An efficient clustering algorithm for partitioning parallel programs (Q1274369) (← links)
- \(N\)-graphs: Scalable topology and design of balanced divide-and-conquer algorithms (Q1391774) (← links)
- Graph partitioning models for parallel computing (Q1583333) (← links)
- Online partitioning method for decentralized control of linear switching large-scale systems (Q1738610) (← links)
- Partitioning graphs on message-passing machines by pairwise mincut (Q1818794) (← links)
- Approximation techniques for hypergraph partitioning problems (Q1891922) (← links)
- Parallelization domain oriented multilevel graph partitioner (Q4571236) (← links)
- (Q4723312) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)
- A permutation parallel algorithm under exchange restriction with message passing interface (Q6051699) (← links)
