𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cluster Identification Algorithms for Spin Models — Sequential and Parallel

✍ Scribed by Baillie, Clive F. ;Coddington, Paul D.

Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
963 KB
Volume
3
Category
Article
ISSN
1040-3108

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

Models and Scheduling Algorithms for Mix
Models and Scheduling Algorithms for Mixed Data and Task Parallel Programs
✍ Soumen Chakrabarti; James Demmel; Katherine Yelick 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 400 KB

An increasing number of scientific programs exhibit two forms of parallelism, often in a nested fashion. At the outer level, the application comprises coarse-grained task parallelism, with dependencies between tasks reflected by an acyclic graph. At the inner level, each node of the graph is a data-

Parallel Algorithms for Hierarchical Clu
Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
✍ Elias Dahlhaus 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 306 KB

We present efficient parallel algorithms for two hierarchical clustering heuristics. We point out that these heuristics can also be applied to solving some algorithmic problems in graphs, including split decomposition. We show that efficient parallel split decomposition induces an efficient parallel