✦ LIBER ✦

PT-Scotch: A tool for efficient parallel graph ordering

✍ Scribed by C. Chevalier; F. Pellegrini

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 231 KB
Volume: 34
Category: Article
ISSN: 0167-8191
DOI: 10.1016/j.parco.2007.12.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Parallel Algorithm for Multilevel Grap

A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering

✍ George Karypis; Vipin Kumar 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 1009 KB

An efficient parallel algorithm for the

An efficient parallel algorithm for the transitive closure of a graph

✍ P. Fraisse 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 377 KB

A Parallel Ring Ordering Algorithm for E

A Parallel Ring Ordering Algorithm for Efficient One-Sided Jacobi SVD Computations

✍ B.B. Zhou; R.P. Brent 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 141 KB

In this paper we give evidence to show that in one-sided Jacobi SVD computation the sorting of column norms in each sweep is very important. An efficient parallel ring Jacobi ordering for computing singular value decomposition is described. This ordering can generate n(n -1)/2 different index pairs

An efficient parallel algorithm for comp

An efficient parallel algorithm for computing a large independent set in a planar graph

✍ Marek Chrobak; Joseph Naor 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 750 KB

Efficiency of partial-order graphs and a

Efficiency of partial-order graphs and an opdering procedure for a numerical data array

✍ E. P. Zabello 📂 Article 📅 1981 🏛 Springer US 🌐 English ⚖ 627 KB

An efficient and scalable block parallel

An efficient and scalable block parallel algorithm of Neville elimination as a tool for the CMB maps problem

✍ P. Alonso; R. Cortina; J. Ranilla; A. M. Vidal 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 308 KB