✦ LIBER ✦

Finding a maximum set of independent chords in a circle

✍ Scribed by R.C. Chang; H.S. Lee

Book ID: 107766095
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 301 KB
Volume: 41
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(92)90262-t

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding a Maximum Independent Set

✍ Tarjan, Robert Endre; Trojanowski, Anthony E. 📂 Article 📅 1977 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 850 KB

Finding a maximum independent set in a p

Finding a maximum independent set in a permutation graph

✍ Haklin Kim 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 374 KB

Finding a Maximum Independent Set in a S

Finding a Maximum Independent Set in a Sparse Random Graph

✍ Feige, Uriel; Ofek, Eran 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 333 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

Heuristic algorithm for finding the maxi

Heuristic algorithm for finding the maximum independent set

✍ A. D. Plotnikov 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 157 KB

An output sensitive algorithm for comput

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

✍ Nicholas Nash; David Gregg 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 181 KB