Pages that link to "Item:Q5132024"
From MaRDI portal
The following pages link to A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs (Q5132024):
Displaying 7 items.
- Improved processor bounds for combinatorial problems in RNC (Q1262128) (← links)
- A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs (Q4623143) (← links)
- Sparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave Equations (Q4997393) (← links)
- Sparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave Equations (Q5161748) (← links)
- Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)
- Newly released capabilities in the distributed-memory SuperLu sparse direct solver (Q6600003) (← links)
- Sparse approximate multifrontal factorization with composite compression methods (Q6601381) (← links)