𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel computation on interval graphs: algorithms and experiments

✍ Scribed by A. Ferreira; I. Guérin Lassous; K. Marcus; A. Rau-Chaplin

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
264 KB
Volume
14
Category
Article
ISSN
1532-0626

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient algorithms for interval graphs
Efficient algorithms for interval graphs and circular-arc graphs
✍ U. I. Gupta; D. T. Lee; J. Y.-T. Leung 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 476 KB

## Abstract We show that for an interval graph given in the form of a family of intervals, a maximum independent set, a minimum covering by disjoint completely connected sets or cliques, and a maximum clique can all be found in __O__(__n__ log __n__) time [__O__(__n__) time if the endpoints of the

Heterogeneous Computing and Parallel Gen
Heterogeneous Computing and Parallel Genetic Algorithms
✍ Enrique Alba; Antonio J. Nebro; José M. Troya 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 495 KB

This paper analyzes some technical and practical issues concerning the heterogeneous execution of parallel genetic algorithms (PGAs). In order to cope with a plethora of different operating systems, security restrictions, and other problems associated to multi-platform execution, we use Java to impl

Parallel algorithm for the computation o
Parallel algorithm for the computation of characteristic polynomials of chemical graphs
✍ P. Venuvanalingam; P. Thangavel 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 413 KB

A parallel algorithm is developed for the f i t time based on Frame's method to compute the characteristic polynomials of chemical graphs. This algorithm can handle all types of graphs: ordinary, weighted, directed, and signed. Our algorithm takes only linear time in the CRCW PRAM model with O(n9) p

Computational Experience with a Parallel
Computational Experience with a Parallel Algorithm for Tetrangle Inequality Bound Smoothing
✍ Kumar Rajan; Narsingh Deo 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 195 KB

Determining molecular structure from interatomic distances is an important and challenging problem. Given a molecule with n atoms, lower and upper bounds on interatomic distances can usually be obtained only for a small subset of the n(n-1) 2 atom pairs, using NMR. Given the bounds so obtained on th

On double and multiple interval graphs
On double and multiple interval graphs
✍ William T. Trotter Jr.; Frank Harary 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 339 KB

## Abstract In this paper we discuss a generalization of the familiar concept of an interval graph that arises naturally in scheduling and allocation problems. We define the interval number of a graph __G__ to be the smallest positive integer __t__ for which there exists a function __f__ which assi