✦ LIBER ✦

A parallel algorithm for solving the coloring problem on trapezoid graphs

✍ Scribed by Shin-ichi Nakayama; Shigeru Masuyama

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 501 KB
Volume: 62
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(97)00082-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel algorithms for the domination p

Parallel algorithms for the domination problems in trapezoid graphs

✍ Y.Daniel Liang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 608 KB

Trapezoid graphs are a superclass of permutation graphs and interval graphs. This paper presents first parallel algorithms for the independent domination, total domination, connected domination and domination problems in weighted trapezoid graphs. All these algorithms take O(log'n) time on a EREW PR

A simple optimal parallel algorithm for

A simple optimal parallel algorithm for the minimum coloring problem on interval graphs

✍ Ming-Shing Yu; Cheng-Hsing Yang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 398 KB

Parallel algorithms for connectivity pro

Parallel algorithms for connectivity problems on interval graphs

✍ Sanjeev Saxena; N.Malahal Rao 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 743 KB

A parallel algorithm for solving the 3D

A parallel algorithm for solving the 3D inverse scattering problem

✍ Ganquan Xie; Qisu Zou 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 306 KB

A parallel algorithm for solving the 3D inverse scattering problem is presented. The inverse problem considered is to determine a potential function from received wave data measured on a surface. The above inverse problem is transformed to a 3D nonlinear integral geometry equation. The principal ter

Algorithms for solving a spatial optimis

Algorithms for solving a spatial optimisation problem on a parallel computer

✍ George, Felicity; Radcliffe, Nicholas; Smith, Mark; Birkin, Mark; Clarke, Martin 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 337 KB 👁 2 views

In a collaborative project between GMAP Ltd and EPCC, an existing heuristic optimisation scheme for strategic resource planning was parallelised to run on the data parallel Connection Machine CM-200. The parallel software was found to run over 2700 times faster than the original workstation software

A parallel tabu search algorithm for sol

A parallel tabu search algorithm for solving the container loading problem

✍ A Bortfeldt; H Gehring; D Mack 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 241 KB

This paper presents a parallel tabu search algorithm for the container loading problem with a single container to be loaded. The emphasis is on the case of a weakly heterogeneous load. The distributed-parallel approach is based on the concept of multi-search threads according to Toulouse et al. [Iss