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

PARALLEL COMBINATORIAL ALGORITHMS FOR MULTI-SETS AND THEIR APPLICATIONS

โœ Scribed by THANH, HOANG CHI

Book ID
127159776
Publisher
World Scientific Publishing Company
Year
2013
Tongue
English
Weight
774 KB
Volume
23
Category
Article
ISSN
0218-1940

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Efficient Sequential and Parallel Algori
Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets
โœ D. Pearson; V.V. Vazirani ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 344 KB

A maximal bipartite set (MBS) in an undirected graph \(G=(V, E)\) is a maximal collection of vertices \(B \subseteq V\) whose induced subgraph is bipartite. In this paper we present efficient sequential (linear time) and parallel (NC) algorithms for constructing an MBS. 1.1993 Acatemic Press, Inc

Parallel Output-Sensitive Algorithms for
Parallel Output-Sensitive Algorithms for Combinatorial and Linear Algebra Problems
โœ John H. Reif ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 160 KB

This paper gives output-sensitive parallel algorithms whose performance depends on the output size and are significantly more efficient tan previous algorithms for problems with sufficiently small output size. Inputs are n\_n matrices over a fixed ground field. Let P(n) and M(n) be the PRAM processo