𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An improvement on parallel computation of a maximal matching

✍ Scribed by Yijie Han

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
481 KB
Volume
56
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A note on parallel complexity of maximum
A note on parallel complexity of maximum f-matching
✍ Anders Dessmark; Oscar Garrido; Andrzej Lingas πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 306 KB

We present a randomized NC solution to the problem of constructing a maximum (cardinality) f-matching. constraints. @ 1998 Elsevier Science B.V.

An implementation of RI–SCF on parallel
An implementation of RI–SCF on parallel computers
✍ Herbert A. FrΓΌchtl; Rick A. Kendall; Robert J. Harrison; Kenneth G. Dyall πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 153 KB πŸ‘ 1 views

The resolution of the identity RI approximation to the Hartree᎐Fock method was implemented within the NWChem suite of ab initio programs for parallel computers. After a description of the method, a detailed account of the implementation is given. We present a sample calculation and compare its perfo