✦ LIBER ✦

Parallel algorithms on circular-arc graphs

✍ Scribed by Alan A. Bertossi; Sabrina Moretti

Book ID: 107765930
Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 1001 KB
Volume: 33
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(90)90209-g

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal parallel algorithm for solvin

An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs

✍ Anita Saha; Madhumangal Pal; Tapan K. Pal 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 232 KB

Algorithms on circular-arc graphs

✍ F. Gavril 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 596 KB

Linear time algorithms on circular-arc g

Linear time algorithms on circular-arc graphs

✍ Wen-Lian Hsu; Kuo-Hui Tsai 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 870 KB

Polynomial time algorithms on circular-a

Polynomial time algorithms on circular-arc overlap graphs

✍ Toshinobu Kashiwabara; Sumio Masuda; Kazuo Nakajima; Toshio Fujisawa 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 417 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

On powers of circular arc graphs and pro

On powers of circular arc graphs and proper circular arc graphs

✍ Carsten Flotow 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 537 KB