✦ LIBER ✦

Parallel algorithms for connectivity problems on interval graphs

✍ Scribed by Sanjeev Saxena; N.Malahal Rao

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 743 KB
Volume: 56
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(95)00128-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel computation on interval graphs:

Parallel computation on interval graphs: algorithms and experiments

✍ A. Ferreira; I. Guérin Lassous; K. Marcus; A. Rau-Chaplin 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 264 KB

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

Linear algorithm for optimal path cover

Linear algorithm for optimal path cover problem on interval graphs

✍ Srinivasa Rao Arikati; C. Pandu Rangan 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 412 KB

An optimal parallel algorithm for the do

An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model

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

Decomposition algorithms for the maximum

Decomposition algorithms for the maximum-weight connected graph problem

✍ Heungsoon Felix Lee; Daniel R. Dooly 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB 👁 1 views

Parallel Algorithms for Orthotropic Prob

Parallel Algorithms for Orthotropic Problems

✍ Ivar Gustafsson; Gunhild Lindskog 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 784 KB

Finite element meshes and node-numberings suitable for parallel solution with equally loaded processors are presented for linear orthotropic elliptic partial differential equations. These problems are of great importance, for instance in the oil and airfoil industries. The linear systems of equation