𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A parallel variant of a heuristical algorithm for graph colouring

✍ Scribed by Janez Z̆erovnik

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A Parallel Algorithm for Lagrange Interp
A Parallel Algorithm for Lagrange Interpolation on the Star Graph
✍ H. Sarbazi-Azad; M. Ould-Khaoua; L.M. Mackenzie; S.G. Akl 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 226 KB

This paper introduces a new parallel algorithm for computing an N(=n!)-point Lagrange interpolation on an n-star (n > 2). The proposed algorithm exploits several communication techniques on stars in a novel way, which can be adapted for computing similar functions. It is optimal and consists of thre