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

Linear time algorithms on circular-arc graphs

โœ Scribed by Wen-Lian Hsu; Kuo-Hui Tsai

Book ID
107765979
Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
870 KB
Volume
40
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Algorithms on circular-arc graphs
Algorithms on circular-arc graphs
โœ F. Gavril ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 596 KB
Parallel algorithms on circular-arc grap
Parallel algorithms on circular-arc graphs
โœ Alan A. Bertossi; Sabrina Moretti ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1001 KB
Efficient algorithms for interval graphs
Efficient algorithms for interval graphs and circular-arc graphs
โœ U. I. Gupta; D. T. Lee; J. Y.-T. Leung ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 476 KB

## Abstract We show that for an interval graph given in the form of a family of intervals, a maximum independent set, a minimum covering by disjoint completely connected sets or cliques, and a maximum clique can all be found in __O__(__n__ log __n__) time [__O__(__n__) time if the endpoints of the