Hybridizing Nested Dissection and Halo Approximate Minimum Degree for Efficient Sparse Matrix Ordering

François Pellegrini, Jean Roman, Patrick Amestoy. Hybridizing Nested Dissection and Halo Approximate Minimum Degree for Efficient Sparse Matrix Ordering. In José D. P. Rolim, Frank Mueller, Albert Y. Zomaya, Fikret Erçal, Stephan Olariu, Binoy Ravindran, Jan Gustafsson, Hiroaki Takada, Ronald A. Olsson, Laxmikant V. Kalé, Peter H. Beckman, Matthew Haines, Hossam A. ElGindy, Denis Caromel, Serge Chaumette, Geoffrey Fox, Yi Pan, Keqin Li, Tao Yang, G. Ghiola, Gianni Conte, Luigi V. Mancini, Dominique Méry, Beverly A. Sanders, Devesh Bhatt, Viktor K. Prasanna, editors, Parallel and Distributed Processing, 11 IPPS/SPDP 99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, San Juan, Puerto Rico, USA, April 12-16, 1999, Proceedi. Volume 1586 of Lecture Notes in Computer Science, pages 986-995, Springer, 1999.

Authors

François Pellegrini

This author has not been identified. Look up 'François Pellegrini' in Google

Jean Roman

This author has not been identified. Look up 'Jean Roman' in Google

Patrick Amestoy

This author has not been identified. Look up 'Patrick Amestoy' in Google