✦ LIBER ✦

Algorithms for maximum independent sets

✍ Scribed by J.M Robson

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 926 KB
Volume: 7
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(86)90032-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A ( °/2) -approximation algorithm for th

A ( °/2) -approximation algorithm for the maximum independent set problem

✍ V.Th. Paschos 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 221 KB

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

An approximation algorithm for the maxim

An approximation algorithm for the maximum independent set problem in cubic planar graphs

✍ Elarbi Choukhmane; John Franco 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 289 KB 👁 1 views

Sequential and parallel algorithms for t

Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs

✍ Ming-Shing Yu; Lin Yu Tseng; Shoe-Jane Chang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 428 KB

A natural model and a parallel algorithm

A natural model and a parallel algorithm for approximately solving the maximum weighted independent set problem

✍ Mohamed Afif; Aristidis Likas; Vangelis Th. Paschos 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 535 KB

A simple linear time algorithm for findi

A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone

✍ Glenn K. Manacher; Terrance A. Mankus 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB 👁 1 views

## Abstract We exhibit an algorithm for finding a maximum independent set (MIS) for __n__ presorted, unweighted circular arcs in time 0(__n__). Unlike previous algorithms, this is achieved by means of trivial postprocessing of the output of a straightforward algorithm for finding an MIS for a set o