Minimum communication cost reordering for parallel sparse Cholesky factorization

W.-Y. Lin, C. L. Chen. Minimum communication cost reordering for parallel sparse Cholesky factorization. Parallel Computing, 25(8):943-967, 1999.

@article{LinC99,
  title = {Minimum communication cost reordering for parallel sparse Cholesky factorization},
  author = {W.-Y. Lin and C. L. Chen},
  year = {1999},
  tags = {C++},
  researchr = {https://researchr.org/publication/LinC99},
  cites = {0},
  citedby = {0},
  journal = {Parallel Computing},
  volume = {25},
  number = {8},
  pages = {943-967},
}