]. M. Références1, S. Berger, and . Bokhari, Partitioning strategy for nonuniform problems on multiprocessors, IEEE Transactions on Computers, issue.5, pp.36570-580, 1987.

J. Gilbert, G. Miller, and S. Teng, Geometric mesh partitioning : Implementation and experiments, Proceedings of International Parallel Processing Symposium, 1995.

M. Heath and P. Raghavan, A Cartesian Parallel Nested Dissection Algorithm, SIAM Journal on Matrix Analysis and Applications, vol.16, issue.1, pp.235-253, 1995.
DOI : 10.1137/S0895479892238270

G. Miller, S. Teng, W. Thurston, and S. Vavasis, Automatic Mesh Partitioning
DOI : 10.1007/978-1-4613-8369-7_3

A. Patra and D. Kim, Efficient mesh partitioning for adaptive hp finite element methods, International Conference on Domain Decomposition Methods, 1998.

J. Pilkington and S. Baden, Partitioning with space filling curves, 1994.

P. Raghavan, Line and plane separators, 1993.

C. Ashcraft and J. Liu, A partition improvement algorithm for generalized nested dissection, 1994.

J. Gilbert, G. Miller, and S. Teng, Geometric mesh partitioning : Implementation and experiments, Proceedings of International Parallel Processing Symposium, 1995.

T. Goehring and Y. Saad, Heuristic algorithms for automatic graph partitioning, 1994.

B. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, pp.291-307, 1970.

P. Sadayappan and F. Ercal, Mapping of finite element graphs onto processor meshes, IEEE Transactions on Computers, issue.36, pp.1408-1424, 1987.

B. Hendrickson and R. Leland, An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations, SIAM Journal on Scientific Computing, vol.16, issue.2, pp.452-469, 1995.
DOI : 10.1137/0916028

A. Pothen, H. Simon, and K. Liou, Partitioning Sparse Matrices with Eigenvectors of Graphs, SIAM Journal on Matrix Analysis and Applications, vol.11, issue.3, pp.430-452, 1990.
DOI : 10.1137/0611030

A. Pothen, H. Simon, L. Wang, and S. Barnard, Towards a fast implementation of spectral nested dissection, Proceedings Supercomputing '92, pp.42-51, 1992.
DOI : 10.1109/SUPERC.1992.236711

A. Gupta, Fast and effective algorithms for graph partitioning and sparse-matrix ordering, IBM Journal of Research and Development, vol.41, issue.1.2, pp.171-183, 1996.
DOI : 10.1147/rd.411.0171

B. Hendrickson and R. Leland, A multilevel algorithm for partitioning graphs, Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) , Supercomputing '95, 1995.
DOI : 10.1145/224170.224228

G. Karypis and V. Kumar, A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs, SIAM Journal on Scientific Computing, vol.20, issue.1, pp.359-392, 1998.
DOI : 10.1137/S1064827595287997

G. Karypis and V. Kumar, Parallel multilevel k-way partitioning scheme for irregular graphs, Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) , Supercomputing '96, 1998.
DOI : 10.1145/369028.369103

B. Monien, R. Preis, and R. Diekmann, Quality matching and local improvement for multilevel graph-partitioning, Parallel Computing, vol.26, issue.12, 1999.
DOI : 10.1016/S0167-8191(00)00049-1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.5351

J. Pilkington and S. Baden, Partitioning with space filling curves, 1994.

I. Unité-de-recherche-inria-rocquencourt-domaine-de-voluceau-rocquencourt-bp, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38330 Montbonnot-St, pp.105-78153, 2004.

I. De-voluceau-rocquencourt, BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN, pp.249-6399