Cited in
(7)- On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices.
- Approximation algorithms in combinatorial scientific computing
- SPRAL
- BUbiNG
- A \(2/3\)-approximation algorithm for vertex-weighted matching
- A 2/3-approximation algorithm for vertex weighted matching in bipartite graphs
- BootCMatch: a software package for bootstrap AMG based on graph weighted matching
This page was built for software: Matchbox
