๐”– Bobbio Scriptorium
โœฆ   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

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
Algorithms for a maximum clique and a ma
โœ 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