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 9 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)
- A parallel graph partitioning algorithm for a message-passing multiprocessor (Q1111029) (← 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)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)
