On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix, SIAM Journal on Matrix Analysis and Applications, vol.22, issue.4, pp.973-996, 2001. ,
DOI : 10.1137/S0895479899358443
Combinatorial Problems in Solving Linear Systems, CERFACS, vol.60, 2009. ,
DOI : 10.1201/b11644-3
URL : https://hal.archives-ouvertes.fr/hal-00763557
Coverings of bipartite graphs, Journal canadien de math??matiques, vol.10, issue.0, pp.517-534, 1958. ,
DOI : 10.4153/CJM-1958-052-0
The Theory of Elimination Trees for Sparse Unsymmetric Matrices, SIAM Journal on Matrix Analysis and Applications, vol.26, issue.3, pp.686-705, 2005. ,
DOI : 10.1137/S089547980240563X
Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices, SIAM Journal on Matrix Analysis and Applications, vol.29, issue.4, pp.1363-1381, 2008. ,
DOI : 10.1137/050643581
Geometric Mesh Partitioning: Implementation and Experiments, SIAM Journal on Scientific Computing, vol.19, issue.6, pp.2091-2110, 1998. ,
DOI : 10.1137/S1064827594275339
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.3807
MeTiS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices Version 4.0, 1998. ,
The Role of Elimination Trees in Sparse Factorization, SIAM Journal on Matrix Analysis and Applications, vol.11, issue.1, pp.134-172, 1990. ,
DOI : 10.1137/0611010
A New Implementation of Sparse Gaussian Elimination, ACM Transactions on Mathematical Software, vol.8, issue.3, pp.256-276, 1982. ,
DOI : 10.1145/356004.356006
Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972. ,
DOI : 10.1137/0201010
An improved algorithm for hierarchical clustering using strong components, Information Processing Letters, vol.17, issue.1, pp.37-41, 1983. ,
DOI : 10.1016/0020-0190(83)90088-1
Inovallée 655 avenue de l'Europe Montbonnot 38334 Saint Ismier Cedex Publisher Inria Domaine de Voluceau -Rocquencourt BP 105 -78153 Le Chesnay Cedex inria, pp.249-6399 ,