๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A parallel algorithm for finding a maximum weight clique of an interval graph

โœ Scribed by Chii-Huah Shyu

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

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Efficient algorithms for finding maximum
Efficient algorithms for finding maximum cliques of an overlap graph
โœ Sumio Masuda; Kazuo Nakajima; Toshinobu Kashiwabara; Toshio Fujisawa ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 728 KB

Let F = { I , , 12,. . . , Z,,} be a finite family of closed intervals on the real line. Two intervals 4 and Ik in F are said to overlap each other if they intersect but neither one of them contains the other. A graph G = (V, E) is called an overlap graph for F if there is a one-to-one correspondenc

Algorithms for a maximum clique and a ma
Algorithms for a maximum clique and a maximum independent set of a circle graph
โœ F. Gavril ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 523 KB

## Abstract Consider a family of chords in a circle. A circle graph is obtained by representing each chord by a vertex, two vertices being connected by an edge when the corresponding chords intersect. In this paper, we describe efficient algorithms for finding a maximum clique and a maximum indepen