๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A faster parallel algorithm for k-connectivity

โœ Scribed by K. Iwama; C. Iwamoto; T. Ohsawaa

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
453 KB
Volume
61
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Efficient NC Algorithm for a Sparse k
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate
โœ Hiroshi Nagamochi; Toru Hasunuma ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 166 KB

We present an efficient algorithm for finding a sparse k-edge-connectivity certificate of a multigraph G. Our algorithm runs in O log kn log k 2 log n 2 time using O k n + m processors on an ARBITRARY CRCW PRAM, where n and m stand for the numbers of vertices in G and edges in the simplified graph o

A practical algorithm for faster matrix
A practical algorithm for faster matrix multiplication
โœ Igor Kaporin ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 69 KB

The purpose of this paper is to present an algorithm for matrix multiplication based on a formula discovered by Pan [7]. For matrices of order up to 10 000, the nearly optimum tuning of the algorithm results in a rather clear non-recursive one-or two-level structure with the operation count comparab