✦ LIBER ✦

An output sensitive algorithm for computing a maximum independent set of a circle graph

✍ Scribed by Nicholas Nash; David Gregg

Book ID: 108154704
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 181 KB
Volume: 110
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2010.05.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 efficient parallel algorithm for comp

An efficient parallel algorithm for computing a large independent set in a planar graph

✍ Marek Chrobak; Joseph Naor 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 750 KB

An Efficient Algorithm for Finding a Max

An Efficient Algorithm for Finding a Maximum Weight k-Independent Set on Trapezoid Graphs

✍ Mrinmoy Hota; Madhumangal Pal; Tapan K. Pal 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 81 KB

An efficient algorithm for finding a max

An efficient algorithm for finding a maximum weight 2-independent set on interval graphs

✍ Ju Yuan Hsiao; Chuan Yi Tang; Ruay Shiung Chang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 606 KB

Tabaris: An exact algorithm based on tab

Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph

✍ C. Friden; A. Hertz; D. de Werra 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 809 KB

An algorithm for finding a large indepen

An algorithm for finding a large independent set in planar graphs

✍ Norishige Chiba; Takao Nishizeki; Nobuji Saito 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 333 KB 👁 1 views