𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel algorithms for planar dominance counting

✍ Scribed by Sung Kwon Kim

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
310 KB
Volume
15
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Parallel Algorithms for Counting and Ran
Parallel Algorithms for Counting and Randomly Generating Integer Partitions
✍ Laura A. Sanchis; Matthew B. Squire πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 228 KB

This paper presents parallel algorithms for determining the number of partitions of a given integer N, where the partitions may be subject to restrictions, such as being composed of distinct parts, of a given number of parts, and/or of parts belonging to a specified set. We present a series of adapt

A Randomized Parallel Algorithm for Plan
A Randomized Parallel Algorithm for Planar Graph Isomorphism
✍ Hillel Gazit; John H Reif πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 223 KB

We present a parallel randomized algorithm running on a CRCW PRAM, to determine whether two planar graphs are isomorphic, and if so to find the isomorphism. We assume that we have a tree of separators for each planar graph Ε½ Ε½ 2 . 1 q β‘€ which can be computed by known algorithms in O log n time with

Parallel algorithms for corner stitching
Parallel algorithms for corner stitching
✍ Mehta, Dinesh P.; Wilson, Erica D. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 252 KB πŸ‘ 1 views

Corner stitching is the underlying data structure that is used to represent rectangular objects in interactive VLSI layout editing systems such as Magic and Tailor. In this paper we develop efficient algorithms for basic corner stitching operations under the message-passing paradigm. These algorithm