A Modified Bandwidth Reduction Heuristic Based on the WBRA and George-Liu Algorithm
暂无分享,去创建一个
Sanderson L. Gonzaga de Oliveira | Guilherme Oliveira Chagas | Diego N. Brandão | Mauricio Kischinhevsky | Diogo T. Robaina
[1] Yuan Jinjiang,et al. Profile minimization problem for matrices and graphs , 1994 .
[2] Jinjiang Yuan,et al. Profile minimization problem for matrices and graphs , 1994 .
[3] G. O. Chagas,et al. An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method , 2018 .
[4] Sanderson L. Gonzaga de Oliveira,et al. A systematic review of heuristics for symmetric-matrix bandwidth reduction : methods not based on metaheuristics , 2015 .
[5] Sanderson L. Gonzaga de Oliveira,et al. A Systematic Review of Heuristics for Profile Reduction of Symmetric Matrices , 2015, ICCS.
[6] Alan George,et al. An Implementation of a Pseudoperipheral Node Finder , 1979, TOMS.
[7] William G. Poole,et al. An algorithm for reducing the bandwidth and profile of a sparse matrix , 1976 .
[8] Christos H. Papadimitriou,et al. The NP-Completeness of the bandwidth minimization problem , 1976, Computing.
[9] S. L. Gonzaga de Oliveira,et al. An evaluation of low-cost heuristics for matrix bandwidth and profile reductions , 2018 .
[10] Timothy A. Davis,et al. The university of Florida sparse matrix collection , 2011, TOMS.
[11] Luciano Tarricone,et al. A new matrix bandwidth reduction algorithm , 1998, Oper. Res. Lett..
[12] Sanderson L. Gonzaga de Oliveira,et al. Metaheuristic-based Heuristics for Symmetric-matrix Bandwidth Reduction: A Systematic Review , 2015, ICCS.