Factorization-Based Graph Repartitionings
From MaRDI portal
Publication:3069593
DOI10.1007/978-3-642-12535-5_92zbMATH Open1280.15007OpenAlexW1493151201MaRDI QIDQ3069593FDOQ3069593
Miroslav Tuma, Katerina Jurkova
Publication date: 18 January 2011
Published in: Large-Scale Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12535-5_92
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Factorization of matrices (15A23) Iterative numerical methods for linear systems (65F10)
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Graph partitioning by eigenvectors π π
- Graph partitioning using linear and semidefinite programming π π
- Factors and factorization of graphs π π
- Graph partitioning π π
- On the use of factorized distribution algorithms for problems defined on graphs π π
- Factorization and pseudofactorization of weighted graphs π π
This page was built for publication: Factorization-Based Graph Repartitionings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3069593)